881 search results - page 8 / 177 » Solving satisfiability problems with preferences |
124
click to vote
CAV
2010
Springer
15 years 6 months ago
2010
Springer
Often one has a preference order among the different systems that satisfy a given specification. Under a probabilistic assumption about the possible inputs, such a preference order...
127
click to vote
BCS
2008
15 years 4 months ago
2008
Digital circuits with feedback loops can solve some instances of NP-hard problems by relaxation: the circuit will either oscillate or settle down to a stable state that represents...
110
Voted
AAAI
2007
15 years 5 months ago
2007
A facility with front room and back room operations has the option of hiring specialized or, more expensive, cross-trained workers. Assuming stochastic customer arrival and servic...
TPLP
2008
15 years 2 months ago
2008
This paper presents a Prolog interface to the MiniSat satisfiability solver. Logic programming with satisfiability combines the strengths of the two paradigms: logic programming f...
ASPDAC
2008
ACM
15 years 4 months ago
2008
ACM
Abstract-- Routing for high-speed boards is largely a timeconsuming manual task today. In this work we consider the ordered escape routing problem which is a key problem in boardle...