1243 search results - page 58 / 249 » On the locality of bounded growth |
103
click to vote
RTCSA
2009
IEEE
15 years 6 months ago
2009
IEEE
The question whether preemptive systems are better than non-preemptive systems has been debated for a long time, but only partial answers have been provided in the real-time liter...
104
click to vote
FSTTCS
2007
Springer
15 years 6 months ago
2007
Springer
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pa...
101
click to vote
SAINT
2005
IEEE
15 years 5 months ago
2005
IEEE
This paper presents a case study to effectively run a parallel branch and bound application on the Grid. The application discussed in this paper is a fine-grain application and is...
ICS
2010
Tsinghua U.
15 years 4 months ago
2010
Tsinghua U.
Quantum k-SAT is the problem of deciding whether there is a n-qubit state which is perpendicular to a set of vectors, each of which lies in the Hilbert space of k qubits. Equivale...
102
click to vote
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...