882 search results - page 76 / 177 » Local Search for Very Large SAT Problems |
AI
2010
Springer
15 years 4 hour ago
2010
Springer
We consider soft constraint problems where some of the preferences may be unspecified. This models, for example, settings where agents are distributed and have privacy issues, or ...
ICCV
2009
IEEE
16 years 4 months ago
2009
IEEE
Visual categorization problems, such as object classification or action recognition,
are increasingly often approached using a detection strategy: a classifier function
is first ...
DAC
1997
ACM
15 years 4 months ago
1997
ACM
Binary Decision Diagrams BDDs are e cient at manipulating large sets in a compact manner. BDDs, however, are inefcient at utilizing the memory hierarchy of the computer. Recent ...
ALGORITHMICA
2006
14 years 12 months ago
2006
Algorithmic methods based on the theory of fixed-parameter tractability are combined with powerful computational platforms to launch systematic attacks on combinatorial problems o...
125
click to vote
CDB
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Long DNA sequences have to be cut using restriction enzymes into small fragments whose lengths and/or nucleotide sequences can be analyzed by currently available technolo...