2398 search results - page 29 / 480 » Constraint Programming and Graph Algorithms |
INFOCOM
2005
IEEE
14 years 2 months ago
2005
IEEE
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
CVPR
2007
IEEE
14 years 2 months ago
2007
IEEE
Energy-minimizing active contour models (snakes) have been proposed for solving many computer vision problems such as object segmentation, surface reconstruction, and object track...
CP
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We study the global cardinality constraint (gcc) and pro
JCP
2006
13 years 8 months ago
2006
Finding a maximum cardinality matching in a graph is a problem appearing in numerous settings. The problem asks for a set of edges of maximum cardinality, such that no two edges of...
AAAI
2006
13 years 10 months ago
2006
Constraint programming is a commonly used technology for solving complex combinatorial problems. However, users of this technology need significant expertise in order to model the...