156 search results - page 23 / 32 » Parallel SAT Solving using Bit-level Operations |
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
ICDCS
2011
IEEE
12 years 7 months ago
2011
IEEE
Many distributed software systems allow participation by large numbers of untrusted, potentially faulty components on an open network. As faults are inevitable in this setting, th...
GCC
2006
Springer
13 years 11 months ago
2006
Springer
Computational Grid technology has been noticed as an issue to solve large-scale bioinformatics-related problems and improves data accuracy and processing speed on multiple computa...
ICCS
2009
Springer
14 years 2 months ago
2009
Springer
Current mathematical modeling methods for the spreading of infectious diseases are too simplified and do not scale well. We present the Simulator of Epidemic Evolution in Complex ...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
Traditional aspect graphs are topology-based and are impractical for articulated objects. In this work we learn a small number of aspects, or prototypical views, from video data. ...