Sciweavers

3433 search results - page 206 / 687
» Heuristics for a bidding problem
Sort
View
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 6 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
CPAIOR
2006
Springer
15 years 10 months ago
AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter