315 search results - page 39 / 63 » A new heuristic to solve the one-warehouse N-retailer proble... |
SAT
2007
Springer
14 years 2 months ago
2007
Springer
SAT solvers are often challenged with very hard problems that remain unsolved after hours of CPU time. The research community meets the challenge in two ways: (1) by improving the ...
WIDM
2006
ACM
14 years 2 months ago
2006
ACM
For a given set of search engines, a search engine is redundant if its searchable contents can be found from other search engines in this set. In this paper, we propose a method t...
BMCBI
2008
13 years 8 months ago
2008
Background: Due to recent progress in genome sequencing, more and more data for phylogenetic reconstruction based on rearrangement distances between genomes become available. Howe...
ICPR
2006
IEEE
14 years 9 months ago
2006
IEEE
Estimating relative camera motion from two views is a classical problem in computer vision. The minimal case for such problem is the so-called five-point-problem, for which the st...
JAIR
2006
13 years 8 months ago
2006
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...