1421 search results - page 53 / 285 » Satisfying KBO Constraints |
CADE
2007
Springer
16 years 5 days ago
2007
Springer
We present a method for proving rigid first order theorems by encoding them as propositional satisfiability problems. We encode the existence of a first order connection tableau an...
INFOCOM
1994
IEEE
15 years 4 months ago
1994
IEEE
This paper is motivated by the need to support multiple service classes in fast packet-switched networks. We address the problem of characterizing and designing scheduling policie...
107
click to vote
CGF
1999
14 years 11 months ago
1999
A fast design variation technique for mechanical systems is presented. It is used to interactively optimize mechanical characteristics while "self-assembling" or satisfy...
100
click to vote
NGC
2007
Springer
14 years 11 months ago
2007
Springer
Abstract Understanding potential genetic factors in disease or development of personalised e-Health solutions require scientists to access a multitude of data and compute resources...
SCHEDULING
2008
14 years 11 months ago
2008
This paper presents a dynamic programming (DP) algorithm for solving a labor scheduling problem with several realistic days-off scheduling constraints and a cost structure that dep...