882 search results - page 34 / 177 » Local Search for Very Large SAT Problems |
104
click to vote
CACM
2010
14 years 10 months ago
2010
As it becomes increasingly viable to capture, store, and share large amounts of image and video data, automatic image analysis is crucial to managing visual information. Many prob...
PPL
2010
14 years 6 months ago
2010
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...
115
click to vote
TSMC
2011
14 years 6 months ago
2011
—The university course timetabling problem (UCTP) is a combinatorial optimization problem, in which a set of events has to be scheduled into time slots and located into suitable ...
IPPS
2006
IEEE
15 years 5 months ago
2006
IEEE
The problem of multiple sequence alignment is one of the most important problems in computational biology. In this paper we present a new method that simultaneously performs multi...
CADE
2006
Springer
16 years 2 days ago
2006
Springer
Abstract. Verification by network invariants is a heuristic to solve uniform verification of parameterized systems. Given a system P, a network invariant for P is that abstracts th...