Results 1  10
of
7,578
Minimum energy mobile wireless networks
 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS
, 1999
"... We describe a distributed positionbased network protocol optimized for minimum energy consumption in mobile wireless networks that support peertopeer communications. Given any number of randomly deployed nodes over an area, we illustrate that a simple local optimization scheme executed at each n ..."
Abstract

Cited by 749 (0 self)
 Add to MetaCart
We describe a distributed positionbased network protocol optimized for minimum energy consumption in mobile wireless networks that support peertopeer communications. Given any number of randomly deployed nodes over an area, we illustrate that a simple local optimization scheme executed at each
On the topologies of local minimum spanning trees
 IN PROCEEDINGS OF THE 3RD WORKSHOP ON COMBINATORIAL AND ALGORITHMIC ASPECTS OF NETWORKING (CAAN’06
, 2006
"... This paper is devoted to study the combinatorial properties of Local Minimum Spanning Trees (LMSTs), a geometric structure that is attracting increasing research interest in the wireless sensor networks community. Namely, we study which topologies are allowed for a sensor network that uses, for supp ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper is devoted to study the combinatorial properties of Local Minimum Spanning Trees (LMSTs), a geometric structure that is attracting increasing research interest in the wireless sensor networks community. Namely, we study which topologies are allowed for a sensor network that uses
Localized minimumenergy broadcasting in AdHoc Networks
, 2003
"... In the minimum energy broadcasting problem, each node can adjust its transmission power in order to minimize total energy consumption but still enable a message originated from a source node to reach all the other nodes in an adhoc wireless network. In all existing solutions each node requires glob ..."
Abstract

Cited by 123 (6 self)
 Add to MetaCart
In the minimum energy broadcasting problem, each node can adjust its transmission power in order to minimize total energy consumption but still enable a message originated from a source node to reach all the other nodes in an adhoc wireless network. In all existing solutions each node requires
Subgoal Chaining and the Local Minimum Problem
 IEEE International Joint Conference on Neural Networks
, 1999
"... It is well known that performing gradient descent on fixed surfaces may result in poor travel through getting stuck in local minima and other surface features. Subgoal chaining in supervised learning is a method to improve travel for neural networks by directing local variation in the surface during ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
during training. This paper shows however that linear subgoal chains such as those used in ERA are not sufficient to overcome the local minimum problem and examines nonlinear subgoal chains as a possible alternative. 1 Introduction A problem long recognised as important for gradient descent techniques
Greedy Randomized Adaptive Search Procedures
, 2002
"... GRASP is a multistart metaheuristic for combinatorial problems, in which each iteration consists basically of two phases: construction and local search. The construction phase builds a feasible solution, whose neighborhood is investigated until a local minimum is found during the local search phas ..."
Abstract

Cited by 647 (82 self)
 Add to MetaCart
GRASP is a multistart metaheuristic for combinatorial problems, in which each iteration consists basically of two phases: construction and local search. The construction phase builds a feasible solution, whose neighborhood is investigated until a local minimum is found during the local search
Solving the Potential Field Local Minimum Problem
"... local minimum problem using internal agent states. Robots and Autonomous Systems, 56 (12). pp. ..."
Abstract
 Add to MetaCart
local minimum problem using internal agent states. Robots and Autonomous Systems, 56 (12). pp.
Region Competition: Unifying Snakes, Region Growing, and Bayes/MDL for Multiband Image Segmentation
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 1996
"... We present a novel statistical and variational approach to image segmentation based on a new algorithm named region competition. This algorithm is derived by minimizing a generalized Bayes/MDL criterion using the variational principle. The algorithm is guaranteed to converge to a local minimum and c ..."
Abstract

Cited by 774 (20 self)
 Add to MetaCart
We present a novel statistical and variational approach to image segmentation based on a new algorithm named region competition. This algorithm is derived by minimizing a generalized Bayes/MDL criterion using the variational principle. The algorithm is guaranteed to converge to a local minimum
Fast approximate energy minimization via graph cuts
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 2001
"... In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function’s smoothness term must only involve pairs of pixels. We propose two algorithms that use graph cuts to compute a local minimum even when v ..."
Abstract

Cited by 2120 (61 self)
 Add to MetaCart
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function’s smoothness term must only involve pairs of pixels. We propose two algorithms that use graph cuts to compute a local minimum even when
TILT STABILITY OF A LOCAL MINIMUM
 SIAM J. OPTIMIZATION
"... The behavior of a minimizing point when an objective function is tilted by adding a small linear term is studied from the perspective of secondorder conditions for local optimality. The classical condition of a positivedefinite Hessian in smooth problems without constraints is found to have an exa ..."
Abstract

Cited by 20 (2 self)
 Add to MetaCart
The behavior of a minimizing point when an objective function is tilted by adding a small linear term is studied from the perspective of secondorder conditions for local optimality. The classical condition of a positivedefinite Hessian in smooth problems without constraints is found to have
Results 1  10
of
7,578