16091 search results - page 264 / 3219 » Solving |
191
click to vote
CPAIOR
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. Logic-based Benders decomposition can combine mixed integer programming and constraint programming to solve planning and scheduling problems much faster than either metho...
189
click to vote
DAC
1996
ACM
15 years 10 months ago
1996
ACM
-- We present a new heuristic algorithm for hazard-free minimization of two-level logic. On nearly all examples, the algorithm finds an exactly minimum-cost cover. It also solves s...
169
click to vote
SWAT
1994
Springer
15 years 10 months ago
1994
Springer
We present sequential and parallel algorithms for various embedding problems on bounded degree partial k-trees and k-connected partial k-trees these include subgraph isomorphism a...
159
click to vote
IJIT
2004
15 years 8 months ago
2004
Expert systems development is a complex and expensive process that needs to be applied in an organized manner. This paper presents an approach for building a generic treatment mode...
161
click to vote
DAGSTUHL
2000
15 years 8 months ago
2000
A strategy S solving a navigation task T is called competitive with ratio r if the cost of solving any instance t of T does not exceed r times the cost of solving t optimally. The ...