Add to ORKGThe time required for a backtracking search procedure to solve a problem can be reduced by employing randomized restart procedures
The RESTART method is a widely applicable simulation technique for the estimation of rare event prob...
This paper revisits replication coupled with checkpointing for fail-stop errors. Replication enable...
We study programs which operate in the presence of possible failures and which must be restarted fro...
Abstract We describe theoretical results and empirical study of context-sensitive restart policies f...
In this work we explore how the complexity of a problem domain affects the performance of evolutiona...
In this paper I describe experiments in the application of dynamic restarts used in heuristic satisf...
Recent work has demonstrated that it is possible to boost the efficiency of combinatorial search pr...
Local search (LS) and multi-agent-based search (ERA [1]) are stochastic and incomplete procedures fo...
We apply the known formulae of the RESTART problem to Markov models of software (and many other) sys...
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically res...
Abstract. Constraint satisfaction and propositional satisfiability problems are often solved using b...
This paper revisits replication coupled with checkpointing for fail-stop errors.Replication enables ...
Abstract. Restart is an application-level technique that speeds up jobs with highly variable complet...
We give an algorithm to minimize the total completion time on-line on a single machine, using restar...
Abstract Restart techniques for randomizing complete search algorithms were proposed recently by Sel...
The RESTART method is a widely applicable simulation technique for the estimation of rare event prob...
This paper revisits replication coupled with checkpointing for fail-stop errors. Replication enable...
We study programs which operate in the presence of possible failures and which must be restarted fro...
Abstract We describe theoretical results and empirical study of context-sensitive restart policies f...
In this work we explore how the complexity of a problem domain affects the performance of evolutiona...
In this paper I describe experiments in the application of dynamic restarts used in heuristic satisf...
Recent work has demonstrated that it is possible to boost the efficiency of combinatorial search pr...
Local search (LS) and multi-agent-based search (ERA [1]) are stochastic and incomplete procedures fo...
We apply the known formulae of the RESTART problem to Markov models of software (and many other) sys...
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically res...
Abstract. Constraint satisfaction and propositional satisfiability problems are often solved using b...
This paper revisits replication coupled with checkpointing for fail-stop errors.Replication enables ...
Abstract. Restart is an application-level technique that speeds up jobs with highly variable complet...
We give an algorithm to minimize the total completion time on-line on a single machine, using restar...
Abstract Restart techniques for randomizing complete search algorithms were proposed recently by Sel...
The RESTART method is a widely applicable simulation technique for the estimation of rare event prob...
This paper revisits replication coupled with checkpointing for fail-stop errors. Replication enable...
We study programs which operate in the presence of possible failures and which must be restarted fro...