1144 search results - page 155 / 229 » Logic programming for combinatorial problems |
135
Voted
ALGORITHMICA
2002
15 years 2 months ago
2002
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
106
click to vote
FCT
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We introduce a uniform framework for reasoning about infinitestate systems with unbounded control structures and unbounded data domains. Our framework is based on constr...
225
click to vote
ECOOP
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. It is common for large-scale Java applications to suffer memory problems, whether inefficient designs that impede scalability, or lifetime bugs such as leaks. Making sens...
224
Voted
POPL
2004
ACM
16 years 2 months ago
2004
ACM
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...
112
click to vote
FPGA
1997
ACM
15 years 6 months ago
1997
ACM
We present a general approach to the FPGA technology mapping problem that applies to any logic block composed of lookup tables LUTs and can yield optimal solutions. The connecti...