1977 search results - page 45 / 396 » The satisfactory partition problem |
173
click to vote
JAIR
2006
15 years 5 months ago
2006
In this paper, we present the partitioning of mutual-exclusion (mutex) constraints in temporal planning problems and its implementation in the SGPlan4 planner. Based on the strong...
157
click to vote
DATE
2006
IEEE
15 years 12 months ago
2006
IEEE
Partitioning is a time consuming and computationally complex optimization problem in the codesign of hardware software systems. The stringent time-to-market requirements have resu...
171
click to vote
CODES
1998
IEEE
15 years 10 months ago
1998
IEEE
The HW/SW partitioning problem addressed in this paper is one of the key steps in the co-design flow of heterogeneous embedded systems. Generally the aim is to provide solutions t...
154
click to vote
FLAIRS
2000
15 years 7 months ago
2000
We first revisit a problem in the literature of genetic algorithms: arranging numbers into groups whose summed weights are as nearly equal as possible. We provide a new genetic al...
156
click to vote
ICCAD
2001
IEEE
16 years 2 months ago
2001
IEEE
Methods based on Boolean satisfiability (SAT) typically use a Conjunctive Normal Form (CNF) representation of the Boolean formula, and exploit the structure of the given problem ...