146 search results - page 5 / 30 » Optimally Solving the MCM Problem Using Pseudo-Boolean Satis... |
91
Voted
ECAI
2006
Springer
14 years 11 months ago
2006
Springer
Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different applicati...
100
click to vote
EMO
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Bilevel optimization problems require every feasible upperlevel solution to satisfy optimality of a lower-level optimization problem. These problems commonly appear in ma...
61
Voted
ICCD
1994
IEEE
15 years 1 months ago
1994
IEEE
This paper presents a simple and robust method of designing the lossy-transmission-line interconnects in a network for multichip modules. This method uses wire-sizing entirely to ...
IJCNN
2000
IEEE
15 years 1 months ago
2000
IEEE
In our recent work, a general method called the stable state analysis technique was developed to determine constraints that the weights in the Hopfield energy function must satisf...
AAAI
2007
14 years 12 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...