8671 search results - page 261 / 1735 » A generator for hierarchical problems |
226
click to vote
TAINN
2005
Springer
16 years 3 days ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
144
click to vote
ISAAC
2004
Springer
15 years 12 months ago
2004
Springer
The k-Leaf Root problem is a particular case of graph power problems. Here, we study “error correction” versions of k-Leaf Root—that is, for instance, adding or deleting at m...
179
Voted
CAEPIA
2003
Springer
15 years 12 months ago
2003
Springer
The Partitioning problem is a key issue in the design of Distributed Virtual Environment (DVE) systems based on a server-network architecture. This problem consist of efficiently ...
157
click to vote
AIPS
2006
15 years 8 months ago
2006
We investigate a task insertion heuristic for oversubscribed scheduling problems, max-availability, that uses a simple estimate of resource contention to assign tasks to intervals...
161
click to vote
IPCO
2004
15 years 8 months ago
2004
We consider the problems of enumerating all minimal strongly connected subgraphs and all minimal dicuts of a given directed graph G = (V, E). We show that the first of these proble...