Sciweavers

1101 search results - page 81 / 221
» heuristics 2007
Sort
View
CAV
2007
Springer
120views Hardware» more  CAV 2007»
14 years 3 months ago
Using Counterexamples for Improving the Precision of Reachability Computation with Polyhedra
Abstract. We present an extrapolation with care set operator to accelerate termination of reachability computation with polyhedra. At the same time, a counterexample guided refine...
Chao Wang, Zijiang Yang, Aarti Gupta, Franjo Ivanc...
DSOM
2007
Springer
14 years 3 months ago
Managing Performance of Aging Applications Via Synchronized Replica Rejuvenation
Abstract. We investigate the problem of ensuring and maximizing performance guarantees for applications suering software aging. Our focus is the optimization of the minimum and av...
Artur Andrzejak, Monika Moser, Luís Moura S...
GD
2007
Springer
14 years 3 months ago
Drawing Graphs with GLEE
This paper describes novel methods we developed to lay out graphs using Sugiyama’s scheme [16] in a tool named GLEE. The main contributions are: a heuristic for creating a graph ...
Lev Nachmanson, George G. Robertson, Bongshin Lee
HM
2007
Springer
135views Optimization» more  HM 2007»
14 years 3 months ago
Hybrid Local Search Techniques for the Resource-Constrained Project Scheduling Problem
This paper proposes a local search algorithm that makes use of a complex neighborhood relation based on a hybridization with a constructive heuristics for the classical resource-co...
Igor Pesek, Andrea Schaerf, Janez Zerovnik
ISAAC
2007
Springer
141views Algorithms» more  ISAAC 2007»
14 years 3 months ago
Algorithms for the Hypergraph and the Minor Crossing Number Problems
Abstract. We consider the problems of hypergraph and minor crossing minimization, and point out a relation between these two problems which has not been exploited before. We presen...
Markus Chimani, Carsten Gutwenger