Sciweavers

4110 search results - page 273 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
CORR
2008
Springer
98views Education» more  CORR 2008»
15 years 6 months ago
Void Traversal for Guaranteed Delivery in Geometric Routing
Geometric routing algorithms like GFG (GPSR) are lightweight, scalable algorithms that can be used to route in resource-constrained ad hoc wireless networks. However, such algorith...
Mikhail Nesterenko, Adnan Vora
EOR
2002
125views more  EOR 2002»
15 years 6 months ago
Genetic local search for multi-objective combinatorial optimization
The paper presents a new genetic local search algorithm for multi-objective combinatorial optimization. The goal of the algorithm is to generate in a short time a set of approxima...
Andrzej Jaszkiewicz
CVIU
2006
158views more  CVIU 2006»
15 years 6 months ago
Sequential mean field variational analysis of structured deformable shapes
A novel approach is proposed to analyzing and tracking the motion of structured deformable shapes, which consist of multiple correlated deformable subparts. Since this problem is ...
Gang Hua, Ying Wu
ICPR
2002
IEEE
16 years 7 months ago
A New Algorithm for Inexact Graph Matching
The graph is an essential data structure for representing relational information. When graphs are used to represent objects, comparing objects amounts to graph matching. Inexact g...
Adel Hlaoui, Shengrui Wang
GECCO
2004
Springer
105views Optimization» more  GECCO 2004»
16 years 2 hour ago
Reducing the Cost of the Hybrid Evolutionary Algorithm with Image Local Response in Electronic Imaging
Abstract. The paper focuses on the efficiency of the hybrid evolutionary algorithm (HEA) for solving the global optimization problem arising in electronic imaging. The particular v...
Igor V. Maslov