592 search results - page 83 / 119 » Using Constraint Programming to Solve the Maximum Clique Pro... |
101
click to vote
CP
2005
Springer
15 years 8 months ago
2005
Springer
QBF is the problem of deciding the satisfiability of quantified boolean formulae in which variables can be either universally or existentially quantified. QBF generalizes SAT (S...
161
click to vote
INFOCOM
2011
IEEE
14 years 6 months ago
2011
IEEE
—We formulate the problem of delay constrained energy-efficient broadcast in cooperative multihop wireless networks. We show that this important problem is not only NPcomplete, ...
116
click to vote
ICCAD
1994
IEEE
15 years 7 months ago
1994
IEEE
? We describe a synthesis system that takes operating range constraints and inter- and intra- circuit parametric manufacturing variations into account while designing a sized and b...
150
click to vote
COMGEO
2008
ACM
15 years 3 months ago
2008
ACM
We consider algorithms for finding the optimal location of a simple transportation device, that we call a moving walkway, consisting of a pair of points in the plane between which ...
126
click to vote
LCTRTS
2010
Springer
15 years 9 months ago
2010
Springer
For its high overall cost during product development, program debugging is an important aspect of system development. Debugging is a hard and complex activity, especially in time-...