Results 1  10
of
4,779
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
node guarantees strong connectivity of the entire network and attains the global minimum energy solution for stationary networks. Due to its localized nature, this protocol proves to be selfreconfiguring and stays close to the minimum energy solution when applied to mobile networks. Simulation results
Multicriteria global minimum cuts
 In Proceedings of the 15th International Symposium on Algorithms and Complexity (ISAAC 2004), Hong Kong, China, LNCS 3341
, 2004
"... We consider two multicriteria versions of the global minimum cut problem in undirected graphs. In the kcriteria setting, each edge of the input graph has k nonnegative costs associated with it. These costs are measured in separate, non interchangeable, units. In the ANDversion of the problem, pur ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We consider two multicriteria versions of the global minimum cut problem in undirected graphs. In the kcriteria setting, each edge of the input graph has k nonnegative costs associated with it. These costs are measured in separate, non interchangeable, units. In the ANDversion of the problem
Global Optimization with Polynomials and the Problem of Moments
 SIAM JOURNAL ON OPTIMIZATION
, 2001
"... We consider the problem of finding the unconstrained global minimum of a realvalued polynomial p(x) : R R, as well as the global minimum of p(x), in a compact set K defined by polynomial inequalities. It is shown that this problem reduces to solving an (often finite) sequence of convex linear ma ..."
Abstract

Cited by 577 (48 self)
 Add to MetaCart
We consider the problem of finding the unconstrained global minimum of a realvalued polynomial p(x) : R R, as well as the global minimum of p(x), in a compact set K defined by polynomial inequalities. It is shown that this problem reduces to solving an (often finite) sequence of convex linear
Global Minimum for Active Contour Models: A Minimal Path Approach
, 1997
"... A new boundary detection approach for shape modeling is presented. It detects the global minimum of an active contour model’s energy between two end points. Initialization is made easier and the curve is not trapped at a local minimum by spurious edges. We modify the “snake” energy by including the ..."
Abstract

Cited by 238 (70 self)
 Add to MetaCart
A new boundary detection approach for shape modeling is presented. It detects the global minimum of an active contour model’s energy between two end points. Initialization is made easier and the curve is not trapped at a local minimum by spurious edges. We modify the “snake” energy by including
Global minimum and orthogonality in Cpclasses
 Math. Nachr
"... In this paper we use recent results [14] to establish various characterizations of the global minimum of the map Fψ: U → R+ defined by Fψ(X) = ‖ψ(X)‖p (1 < p < ∞) where ψ: U → Cp is a map defined by ψ(X) = S+φ(X), with φ: B(H) → B(H) a linear map and S ∈ Cp, and U = {X ∈ B(H) : φ(X) ∈ Cp}. F ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
In this paper we use recent results [14] to establish various characterizations of the global minimum of the map Fψ: U → R+ defined by Fψ(X) = ‖ψ(X)‖p (1 < p < ∞) where ψ: U → Cp is a map defined by ψ(X) = S+φ(X), with φ: B(H) → B(H) a linear map and S ∈ Cp, and U = {X ∈ B(H) : φ(X) ∈ Cp
VERY HIGH RESOLUTION INTERPOLATED CLIMATE SURFACES FOR GLOBAL LAND AREAS
, 2005
"... We developed interpolated climate surfaces for global land areas (excluding Antarctica) at a spatial resolution of 30 arc s (often referred to as 1km spatial resolution). The climate elements considered were monthly precipitation and mean, minimum, and maximum temperature. Input data were gathered ..."
Abstract

Cited by 553 (8 self)
 Add to MetaCart
We developed interpolated climate surfaces for global land areas (excluding Antarctica) at a spatial resolution of 30 arc s (often referred to as 1km spatial resolution). The climate elements considered were monthly precipitation and mean, minimum, and maximum temperature. Input data were gathered
Global minimumjerk trajectory planning of robot manipulators
 IEEE Transactions on Industrial Electronics
, 2000
"... Abstract—A new approach based on interval analysis is developed to find the global minimumjerk (MJ) trajectory of a robot manipulator within a joint space scheme using cubic splines. MJ trajectories are desirable for their similarity to human joint movements and for their amenability to path trac ..."
Abstract

Cited by 26 (0 self)
 Add to MetaCart
Abstract—A new approach based on interval analysis is developed to find the global minimumjerk (MJ) trajectory of a robot manipulator within a joint space scheme using cubic splines. MJ trajectories are desirable for their similarity to human joint movements and for their amenability to path
Fast Marching The Global Minimum Of Active Contours
 in Proc. IEEE International Conference on Image Processing (ICIP’96
, 1996
"... A new approach of edge integration for shape modeling is presented. It is used to find the global minimum of an active contour model's energy between two points. Initialization is made easier and the curve is not trapped at a local minimum by spurious edges. We modify the "snake" ener ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
A new approach of edge integration for shape modeling is presented. It is used to find the global minimum of an active contour model's energy between two points. Initialization is made easier and the curve is not trapped at a local minimum by spurious edges. We modify the "
A new exclusion test for finding the global minimum
, 2007
"... Exclusion algorithms have been used recently to find all solutions of a system of nonlinear equations or to find the global minimum of a function over a compact domain. These algorithms are based on a minimization condition that can be applied to each cell in the domain. In this paper, we consider L ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Exclusion algorithms have been used recently to find all solutions of a system of nonlinear equations or to find the global minimum of a function over a compact domain. These algorithms are based on a minimization condition that can be applied to each cell in the domain. In this paper, we consider
A random search approach to finding the global minimum
 Int.J.Contemp.Math.Science
, 2010
"... Abstract In this study, a new random search algorithm is proposed for finding the global minimum. It is tested on 21 benchmark minimization problems, and its solutions are compared to those of several previously proposed techniques: an adaptive random search, a heuristic random search, the ant colo ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract In this study, a new random search algorithm is proposed for finding the global minimum. It is tested on 21 benchmark minimization problems, and its solutions are compared to those of several previously proposed techniques: an adaptive random search, a heuristic random search, the ant
Results 1  10
of
4,779