2089 search results - page 214 / 418 » A New Problem in String Searching |
128
click to vote
DAC
2004
ACM
16 years 4 months ago
2004
ACM
Instances of the Boolean satisfiability problem (SAT) arise in many areas of circuit design and verification. These instances are typically constructed from some human-designed ar...
120
Voted
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
This paper introduces a novel analogy with the way in which honeybee colonies operate in order to solve the problem of sparse and quasi dense reconstruction. To successfully solve...
124
click to vote
ENTCS
2006
15 years 3 months ago
2006
New heuristics and strategies have enabled major advancements in SAT solving in recent years. However, experimentation has shown that there is no winning solution that works in al...
126
click to vote
PAMI
2007
15 years 2 months ago
2007
—We present a novel convex programming scheme to solve matching problems, focusing on the challenging problem of matching in a large search range and with cluttered background. M...
160
click to vote
EDBT
2002
ACM
16 years 3 months ago
2002
ACM
Applying meta search systems is a suitable method to support the user if there are many different services. Due to information splitting strategies of literature services existing ...