1977 search results - page 72 / 396 » The satisfactory partition problem |
130
click to vote
COMPGEOM
2004
ACM
15 years 11 months ago
2004
ACM
We consider the problem of constructing binary space partitions (BSPs) for orthogonal subdivisions (space filling packings of boxes) in d-space. We show that a subdivision with n...
139
click to vote
CAV
2004
Springer
15 years 11 months ago
2004
Springer
Verifying whether an ω-regular property is satisfied by a finite-state system is a core problem in model checking. Standard techniques build an automaton with the complementary ...
206
click to vote
EUROPAR
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We use a parallel direct solver based on the Schur complement method for solving large sparse linear systems arising from the finite element method. A domain decompositi...
159
click to vote
ICDCS
1998
IEEE
15 years 10 months ago
1998
IEEE
Network applications and services need to be environment-aware in order to meet non-functional requirements in increasingly dynamic contexts. In this paper we consider partition a...
157
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
In this communication Simulated Annealing and Genetic Algorithms, are applied to the graph partitioning problem. These techniques mimic processes in statistical mechanics and biol...