Sciweavers

5316 search results - page 55 / 1064
» Which Search Problems Are Random
Sort
View
WEA
2005
Springer
154views Algorithms» more  WEA 2005»
15 years 6 months ago
Experimental Evaluation of the Greedy and Random Algorithms for Finding Independent Sets in Random Graphs
This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...
Mark K. Goldberg, D. Hollinger, Malik Magdon-Ismai...
90
Voted
AIPS
2008
15 years 3 months ago
A New Local Search for the Job Shop Problem with Uncertain Durations
In the sequel we consider the job shop scheduling problem with uncertain durations represented as triangular fuzzy numbers. We propose a new neighbourhood structure for local sear...
Inés González Rodríguez, Cami...
115
Voted
GECCO
2007
Springer
211views Optimization» more  GECCO 2007»
15 years 7 months ago
An extremal optimization search method for the protein folding problem: the go-model example
The protein folding problem consists of predicting the functional (native) structure of the protein given its linear sequence of amino acids. Despite extensive progress made in un...
Alena Shmygelska
80
Voted
ESA
2009
Springer
98views Algorithms» more  ESA 2009»
15 years 7 months ago
The Oil Searching Problem
Given n potential oil locations, where each has oil at a certain depth, we seek good trade-offs between the number of oil sources found and the total amount of drilling performed. ...
Andrew McGregor, Krzysztof Onak, Rina Panigrahy
90
Voted
GECCO
2006
Springer
145views Optimization» more  GECCO 2006»
15 years 4 months ago
Multi-objective genetic algorithms for pipe arrangement design
This paper presents an automatic design method for piping arrangement. A pipe arrangement design problem is proposed for a space in which many pipes and objects co-exist. This pro...
Satoshi Ikehira, Hajime Kimura