3510 search results - page 132 / 702 » Searching with numbers |
175
click to vote
ICTAI
2006
IEEE
16 years 17 days ago
2006
IEEE
In this paper a new approach for computing Strong Backdoor sets of boolean formula in conjunctive normal form (CNF) is proposed. It makes an original use of local search technique...
182
click to vote
MM
2004
ACM
15 years 12 months ago
2004
ACM
We present a method for searching databases of symbolically represented polyphonic music that exploits advantages of transportation distances such as continuity and partial matchi...
150
click to vote
STACS
2004
Springer
15 years 12 months ago
2004
Springer
We present two simple algorithms for SAT and prove upper bounds on their running time. Given a Boolean formula F in conjunctive normal form, the first algorithm finds a satisfyin...
141
click to vote
COCO
1990
Springer
15 years 10 months ago
1990
Springer
d Abstract) Eric Allender Christopher Wilson Department of Computer Science Department of Computer Rutgers University and Information Science New Brunswick, NJ 08903, USA Universit...
162
click to vote
CASES
2001
ACM
15 years 10 months ago
2001
ACM
Current development tools for embedded real-time systems do not efficiently support the timing aspect. The most important timing parameter for scheduling and system analysis is th...