1480 search results - page 153 / 296 » Ants can solve constraint satisfaction problems |
204
click to vote
JUCS
2006
15 years 6 months ago
2006
: The need for processing biological information is rapidly growing, owing to the masses of new information in digital form being produced at this time. Old methodologies for proce...
211
click to vote
SAS
1994
Springer
15 years 10 months ago
1994
Springer
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
185
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Symmetries are intrinsic to many combinatorial problems including Boolean Satisfiability (SAT) and Constraint Programming (CP). In SAT, the identification of symmetry breaking pred...
194
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
It has been shown that the 3D shape of a deformable surface in an image can be recovered by establishing correspondences between that image and a reference one in which the shape ...
140
click to vote
ASPDAC
2009
ACM
16 years 1 months ago
2009
ACM
— 1In this paper, we will present a placement method for analog circuits. We consider both common centroid and 1-D symmetry constraints, which are the two most common types of pl...