Sciweavers

4679 search results - page 122 / 936
» Modeling When Connections Are the Problem
Sort
View
GECCO
2007
Springer
164views Optimization» more  GECCO 2007»
15 years 7 months ago
Is the island model fault tolerant?
In this paper, we present a study on the fault tolerance nature of the island model when applied to Genetic Algorithms. Parallel and distributed models have been extensively appli...
José Ignacio Hidalgo, Juan Lanchares, Franc...
123
Voted
EUROCOLT
1999
Springer
15 years 6 months ago
Query by Committee, Linear Separation and Random Walks
Abstract. Recent works have shown the advantage of using Active Learning methods, such as the Query by Committee (QBC) algorithm, to various learning problems. This class of Algori...
Ran Bachrach, Shai Fine, Eli Shamir
100
Voted
ADG
2000
Springer
110views Mathematics» more  ADG 2000»
15 years 6 months ago
Decision Complexity in Dynamic Geometry
Abstract. Geometric straight-line programs [5, 8] can be used to model geometric constructions and their implicit ambiguities. In this paper we discuss the complexity of deciding w...
Ulrich Kortenkamp, Jürgen Richter-Gebert
STOC
2003
ACM
152views Algorithms» more  STOC 2003»
16 years 1 months ago
Cell-probe lower bounds for the partial match problem
Given a database of n points in {0, 1}d, the partial match problem is: In response to a query x in {0, 1, }d, find a database point y such that for every i whenever xi = , we have...
T. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Raba...
CPAIOR
2008
Springer
15 years 3 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann