Sciweavers

3320 search results - page 189 / 664
» Heuristics for the Phylogeny Problem
Sort
View
ICML
1995
IEEE
16 years 7 months ago
Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem
In this paper we introduce Ant-Q, a family of algorithms which present many similarities with Q-learning (Watkins, 1989), and which we apply to the solution of symmetric and asymm...
Luca Maria Gambardella, Marco Dorigo
CVPR
2010
IEEE
16 years 2 months ago
The Cluttered Background Problem for Active Contours: A Minimum-Latency Solution
We present a region-based active contour detection algorithm for objects that exhibit relatively homogeneous photometric characteristics (e.g. smooth color or gray levels), embedd...
Stefano Soatto, Ganesh Sundaramoorthi, Anthony Yez...
CP
2007
Springer
16 years 24 days ago
Solving the Salinity Control Problem in a Potable Water System
Salinity is the relative concentration of salts in water. In a city of southern China, the local water supply company pumps water from a nearby river for potable use. During the wi...
Chiu Wo Choi, Jimmy Ho-Man Lee
IPPS
2005
IEEE
16 years 7 days ago
A Distributed Chained Lin-Kernighan Algorithm for TSP Problems
The Chained Lin-Kernighan algorithm (CLK) is one of the best heuristics to solve Traveling Salesman Problems (TSP). In this paper a distributed algorithm is proposed, were nodes i...
Thomas Fischer, Peter Merz
CP
1999
Springer
15 years 11 months ago
Rewriting Numeric Constraint Satisfaction Problems for Consistency Algorithms
Reformulating constraint satisfaction problems (CSPs) in lower arity is a common procedure when computing consistency. Lower arity CSPs are simpler to treat than high arity CSPs. ...
Claudio Lottaz