2398 search results - page 326 / 480 » Constraint Programming and Graph Algorithms |
168
click to vote
CAV
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. CirCUs is a satisfiability solver that works on a combination of AndInverter-Graph, CNF clauses, and BDDs. It has been designed to work well with bounded model checking. ...
144
click to vote
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...
141
Voted
CC
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. This paper presents the design, implementation and experimental evaluation of a practical region-based partial dead code elimination (PDE) algorithm on predicated code in...
184
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
—The optimum multiuser detection (OMD) is a discrete (binary) optimization. The previously developed approaches often relax it by a semi-definite program (SDP) and then employ r...
186
click to vote
LOGCOM
1998
15 years 4 months ago
1998
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...