Results 1  10
of
219,201
The threedimensional FermatWeber problem with Tchebychev distances
"... Abstract: The threedimensional FermatWeber facility location problem with Tchebychev distances is investigated. Expanding on previous research for the analogous twodimensional problem, this study presents a new algorithm for solving the elusive threedimensional case. The algorithm presented here ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract: The threedimensional FermatWeber facility location problem with Tchebychev distances is investigated. Expanding on previous research for the analogous twodimensional problem, this study presents a new algorithm for solving the elusive threedimensional case. The algorithm presented
The inverse FermatWeber problem
, 2008
"... Given n points in the plane with nonnegative weights, the inverse FermatWeber problem consists in changing the weights at minimum cost such that a prespecified point in the plane becomes the Euclidean 1median. The cost is proportional to the increase or decrease of the corresponding weight. In cas ..."
Abstract

Cited by 6 (6 self)
 Add to MetaCart
Given n points in the plane with nonnegative weights, the inverse FermatWeber problem consists in changing the weights at minimum cost such that a prespecified point in the plane becomes the Euclidean 1median. The cost is proportional to the increase or decrease of the corresponding weight
The inverse FermatWeber problem
, 2008
"... Given n points in the plane with nonnegative weights, the inverse FermatWeber problem consists in changing the weights at minimum cost such that a prespecified point in the plane becomes the Euclidean 1median. The cost is proportional to the increase or decrease of the corresponding weight. In cas ..."
Abstract
 Add to MetaCart
Given n points in the plane with nonnegative weights, the inverse FermatWeber problem consists in changing the weights at minimum cost such that a prespecified point in the plane becomes the Euclidean 1median. The cost is proportional to the increase or decrease of the corresponding weight
Adhoc OnDemand Distance Vector Routing
 IN PROCEEDINGS OF THE 2ND IEEE WORKSHOP ON MOBILE COMPUTING SYSTEMS AND APPLICATIONS
, 1997
"... An adhoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure. In this paper we present Adhoc On Demand Distance Vector Routing (AODV), a novel algorithm for the operation of such adhoc n ..."
Abstract

Cited by 3167 (15 self)
 Add to MetaCart
An adhoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure. In this paper we present Adhoc On Demand Distance Vector Routing (AODV), a novel algorithm for the operation of such ad
SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad Hoc Networks
, 2003
"... An ad hoc network is a collection of wireless computers (nodes), communicating among themselves over possibly multihop paths, without the help of any infrastructure such as base stations or access points. Although many previous ad hoc network routing protocols have been based in part on distance vec ..."
Abstract

Cited by 522 (8 self)
 Add to MetaCart
vector approaches, they have generally assumed a trusted environment. In this paper, we design and evaluate the Secure Efficient Ad hoc Distance vector routing protocol (SEAD), a secure ad hoc network routing protocol based on the design of the DestinationSequenced DistanceVector routing protocol
Dynamic programming algorithm optimization for spoken word recognition
 IEEE Transactions on Acoustics, Speech, and Signal Processing
, 1978
"... AbstractThis paper reports on an optimum dynamic programming (DP) based timenormalization algorithm for spoken word recognition. First, a general principle of timenormalization is given using timewarping function. Then, two timenormalized distance definitions, ded symmetric and asymmetric forms, ..."
Abstract

Cited by 764 (3 self)
 Add to MetaCart
AbstractThis paper reports on an optimum dynamic programming (DP) based timenormalization algorithm for spoken word recognition. First, a general principle of timenormalization is given using timewarping function. Then, two timenormalized distance definitions, ded symmetric and asymmetric forms
Optimization Flow Control, I: Basic Algorithm and Convergence
 IEEE/ACM TRANSACTIONS ON NETWORKING
, 1999
"... We propose an optimization approach to flow control where the objective is to maximize the aggregate source utility over their transmission rates. We view network links and sources as processors of a distributed computation system to solve the dual problem using gradient projection algorithm. In thi ..."
Abstract

Cited by 690 (64 self)
 Add to MetaCart
We propose an optimization approach to flow control where the objective is to maximize the aggregate source utility over their transmission rates. We view network links and sources as processors of a distributed computation system to solve the dual problem using gradient projection algorithm
Theoretical improvements in algorithmic efficiency for network flow problems

, 1972
"... This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps req ..."
Abstract

Cited by 565 (0 self)
 Add to MetaCart
This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps
The broadcast storm problem in a mobile ad hoc network
 ACM Wireless Networks
, 2002
"... Broadcasting is a common operation in a network to resolve many issues. In a mobile ad hoc network (MANET) in particular, due to host mobility, such operations are expected to be executed more frequently (such as finding a route to a particular host, paging a particular host, and sending an alarm s ..."
Abstract

Cited by 1217 (15 self)
 Add to MetaCart
signal). Because radio signals are likely to overlap with others in a geographical area, a straightforward broadcasting by flooding is usually very costly and will result in serious redundancy, contention, and collision, to which we refer as the broadcast storm problem. In this paper, we iden
Results 1  10
of
219,201