Sciweavers

125 search results - page 22 / 25
» Computing Pool: A Simplified and Practical Computational Gri...
Sort
View
ICALP
2003
Springer
14 years 20 days ago
Analysis of a Simple Evolutionary Algorithm for Minimization in Euclidean Spaces
Although evolutionary algorithms (EAs) are widely used in practical optimization, their theoretical analysis is still in its infancy. Up to now results on the (expected) runtime ar...
Jens Jägersküpper
ATAL
2006
Springer
13 years 11 months ago
Tractable negotiation in tree-structured domains
Multiagent resource allocation is a timely and exciting area of research at the interface of Computer Science and Economics. One of the main challenges in this area is the high co...
Yann Chevaleyre, Ulle Endriss, Nicolas Maudet
AAAI
2007
13 years 9 months ago
Purely Epistemic Markov Decision Processes
Planning under uncertainty involves two distinct sources of uncertainty: uncertainty about the effects of actions and uncertainty about the current state of the world. The most wi...
Régis Sabbadin, Jérôme Lang, N...
CONSTRAINTS
2008
78views more  CONSTRAINTS 2008»
13 years 7 months ago
Boosting Haplotype Inference with Local Search
Abstract. A very challenging problem in the genetics domain is to infer haplotypes from genotypes. This process is expected to identify genes affecting health, disease and response...
Inês Lynce, João Marques-Silva, Steve...
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
14 years 7 months ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang