Tools

"... GRASP is a multi-start metaheuristic for combinatorial problems, in which each iteration consists basically of two phases: construction and local search. The construction phase builds a feasible solution, whose neighborhood is investigated until a local minimum is found during the local search phas ..."

GRASP is a multi-start metaheuristic for combinatorial problems, in which each iteration consists basically of two phases: construction and local search. The construction phase builds a feasible solution, whose neighborhood is investigated until a local minimum is found during the local search

"... Abstract. In this paper, we present a major improvement in the search procedures in constraint programming. First, we integrate various search procedures from AI and OR. Second, we parallelize the search on shared-memory computers. Third, we add an object-oriented extensible control language to impl ..."

Abstract. In this paper, we present a major improvement in the searchprocedures in constraint programming. First, we integrate various searchprocedures from AI and OR. Second, we parallelize the search on shared-memory computers. Third, we add an object-oriented extensible control language

"... Tabu Search is a metaheuristic that guides a local heuristic search procedure to explore the solution space beyond local optimality. One of the main components of tabu search is its use of adaptive memory, which creates a more flexible search behavior. Memory based strategies are therefore the hallm ..."

Tabu Search is a metaheuristic that guides a local heuristic searchprocedure to explore the solution space beyond local optimality. One of the main components of tabu search is its use of adaptive memory, which creates a more flexible search behavior. Memory based strategies are therefore

Abstract. The pertinent literature controversially discusses in which respects evo-lutionary algorithms differ from classical gradient methods. This chapter presents a hybrid, called the evolutionary-gradient-searchprocedure, that uses evolutionary variations to estimate the gradient direction

"... 1 Induction as a Search Procedure This chapter introduces Inductive Logic Programming from the perspective of search al-gorithms in Computer Science. It first briefly considers the Version Spaces approach to induc-tion, and then focuses on Inductive Logic Programming: from its formal definition and ..."

1 Induction as a SearchProcedure This chapter introduces Inductive Logic Programming from the perspective of search al-gorithms in Computer Science. It first briefly considers the Version Spaces approach to induc-tion, and then focuses on Inductive Logic Programming: from its formal definition

"... We introduce a greedy local search procedure called GSAT for solving propositional satisfiability problems. Our experiments show that this procedure can be used to solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional approac ..."

We introduce a greedy local searchprocedure called GSAT for solving propositional satisfiability problems. Our experiments show that this procedure can be used to solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional

"... Abstract The usual procedure for searching for new phenomena in high energy physics involves a frequentist hypothesis test followed by the construction of an interval for the parameter of interest. This procedure has a couple of well-known flaws: the effect of the test on subsequent inference is ig ..."

Abstract The usual procedure for searching for new phenomena in high energy physics involves a frequentist hypothesis test followed by the construction of an interval for the parameter of interest. This procedure has a couple of well-known flaws: the effect of the test on subsequent inference

"... This paper introduces the ant colony system (ACS), a distributed algorithm that is applied to the traveling salesman problem (TSP). In the ACS, a set of cooperating agents called ants cooperate to find good solutions to TSP’s. Ants cooperate using an indirect form of communication mediated by a pher ..."

"... We describe four versions of a Greedy Randomized Adaptive Search Procedure (GRASP) for finding approximate solutions of general instances of the Steiner Problem in Graphs. Di#erent construction and local search algorithms are presented. Preliminary computational results with one of the versions ..."

We describe four versions of a Greedy Randomized Adaptive SearchProcedure (GRASP) for finding approximate solutions of general instances of the Steiner Problem in Graphs. Di#erent construction and local search algorithms are presented. Preliminary computational results with one

"... We consider the problem of identifying an unknown value x E (1, Z,..., n} using only comparisons of x to constants when as many as E of the comparisons may receive erroneous answers. For a continuous analogue of this problem we show that there is a unique strategy that is optimal in the worst case. ..."

of this search problem with errors is equivalent to the problem of finding the minimal root of a set of increasing functions. The modified version is then also shown to be of complexity logsn + E. logslogsn + O(E * log&).