Sciweavers

740 search results - page 41 / 148
» Optimal heuristic algorithms for the image of an injective f...
Sort
View
ANOR
2005
120views more  ANOR 2005»
13 years 8 months ago
Solving the Vehicle Routing Problem with Stochastic Demands using the Cross-Entropy Method
An alternate formulation of the classical vehicle routing problem with stochastic demands (VRPSD) is considered. We propose a new heuristic method to solve the problem. The algori...
Krishna Chepuri, Tito Homem-de-Mello
CISIS
2008
IEEE
13 years 8 months ago
A Study of Maximum Lifetime Routing in Sparse Sensor Networks
A major issue in wireless sensor networks is to prolong network lifetime by efficient energy management. In this paper we present an initial study of maximum lifetime routing in s...
Ewa Hansen, Mikael Nolin, Mats Björkman
PAMI
2010
245views more  PAMI 2010»
13 years 7 months ago
A Combinatorial Solution for Model-Based Image Segmentation and Real-Time Tracking
—We propose a combinatorial solution to determine the optimal elastic matching of a deformable template to an image. The central idea is to cast the optimal matching of each temp...
Thomas Schoenemann, Daniel Cremers
APPML
2002
58views more  APPML 2002»
13 years 8 months ago
Layered clusters of tightness set functions
A method for structural clustering is proposed involving data on subset-to-entity linkages that can be calculated with structural data such as graphs or sequences or images. The m...
Boris Mirkin, Ilya B. Muchnik
GPEM
2002
163views more  GPEM 2002»
13 years 8 months ago
Fast Ant Colony Optimization on Runtime Reconfigurable Processor Arrays
Ant Colony Optimization (ACO) is a metaheuristic used to solve combinatorial optimization problems. As with other metaheuristics, like evolutionary methods, ACO algorithms often sh...
Daniel Merkle, Martin Middendorf