8413 search results - page 18 / 1683 » Ordering Problem Subgoals |
COCO
1998
Springer
14 years 3 days ago
1998
Springer
We show that the satisfiability problem for bounded-error probabilistic ordered branching programs is NP-complete. If the error is very small, however (more precisely, if the erro...
COCOA
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
PODS
2008
ACM
14 years 8 months ago
2008
ACM
We consider a fundamental flow maximization problem that arises during the evaluation of multiple overlapping queries defined on a data stream, in a heterogenous parallel environm...
AMC
2005
13 years 7 months ago
2005
We consider self-adjoint singularly perturbed two-point boundary value problems in conservation form. Highest possible order of uniform convergence for such problems achieved hith...
GLVLSI
2002
IEEE
14 years 25 days ago
2002
IEEE
As an efficient representation of Extended Finite State Machines, Multiway Decision Graphs (MDG) are suitable for automatic hardware verification of Register Transfer Level (RTL) ...