1480 search results - page 108 / 296 » Ants can solve constraint satisfaction problems |
311
click to vote
TKDE
2012
13 years 8 months ago
2012
—The pairwise constraints specifying whether a pair of samples should be grouped together or not have been successfully incorporated into the conventional clustering methods such...
168
click to vote
ICCAD
2008
IEEE
16 years 3 months ago
2008
IEEE
Abstract— This paper addresses the problem of solving finite word-length (bit-vector) arithmetic with applications to equivalence verification of arithmetic datapaths. Arithmet...
150
click to vote
ENDM
2010
15 years 3 months ago
2010
This paper deals with an NP-hard bi-objective one-machine problem with ready times involving maximum lateness and unit family setup cost objectives. Considering separately both ob...
170
click to vote
APLAS
2000
ACM
15 years 10 months ago
2000
ACM
We have implemented Kima, an automated error correction system for concurrent logic programs. Kima corrects near-misses such as wrong variable occurrences in the absence of explici...
164
click to vote
HICSS
2008
IEEE
16 years 27 days ago
2008
IEEE
Anti-money laundering is a pressing issue in today’s economy. With the newly launched Chinese anti-money laundering regulation, this issue has drawn more and more attention from...