9119 search results - page 135 / 1824 » A Simultaneous Search Problem |
EVOW
2009
Springer
14 years 10 months ago
2009
Springer
Abstract. In this paper we propose a new benchmark problem for dynamic combinatorial optimisation. Unlike most previous benchmarks, we focus primarily on the underlying dynamics of...
114
click to vote
CEC
2010
IEEE
15 years 1 months ago
2010
IEEE
In this paper we present a simple and general new No Free Lunch-like result that applies to revisiting algorithms searching arbitrary problem sets. We begin by unifying the assumpt...
131
click to vote
ICCAD
2009
IEEE
14 years 10 months ago
2009
IEEE
Computational protein design can be formulated as an optimization problem, where the objective is to identify the sequence of amino acids that minimizes the energy of a given prot...
119
click to vote
FOCS
2006
IEEE
15 years 6 months ago
2006
IEEE
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...
103
Voted
AIIA
2009
Springer
15 years 7 months ago
2009
Springer
This paper studies the following question: given an instance of the propositional satisfiability problem, a randomized satisfiability solver, and a cluster of n computers, what i...