Sciweavers

1243 search results - page 58 / 249
» On the locality of bounded growth
Sort
View
RTCSA
2009
IEEE
14 years 2 months ago
Bounding the Maximum Length of Non-preemptive Regions under Fixed Priority Scheduling
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...
Gang Yao, Giorgio C. Buttazzo, Marko Bertogna
FSTTCS
2007
Springer
14 years 1 months ago
Better Algorithms and Bounds for Directed Maximum Leaf Problems
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...
Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael ...
SAINT
2005
IEEE
14 years 1 months ago
A Case Study in Running a Parallel Branch and Bound Application on the Grid
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...
Kento Aida, Tomotaka Osumi
ICS
2010
Tsinghua U.
13 years 11 months ago
Bounds on the Quantum Satisfiability Threshold
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...
Sergey Bravyi, Cristopher Moore, Alexander Russell
GECCO
2006
Springer
151views Optimization» more  GECCO 2006»
13 years 11 months ago
Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO
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...
Martin Gruber, Jano I. van Hemert, Günther R....