Sciweavers

934 search results - page 8 / 187
» A theoretical analysis of the HIFF problem
Sort
View
NIPS
2007
14 years 11 months ago
Theoretical Analysis of Heuristic Search Methods for Online POMDPs
Planning in partially observable environments remains a challenging problem, despite significant recent advances in offline approximation techniques. A few online methods have a...
Stéphane Ross, Joelle Pineau, Brahim Chaib-...
IJCAI
2007
14 years 11 months ago
An Information-Theoretic Analysis of Memory Bounds in a Distributed Resource Allocation Mechanism
Multiagent distributed resource allocation requires that agents act on limited, localized information with minimum communication overhead in order to optimize the distribution of ...
Ricardo M. Araujo, Luís C. Lamb
MOC
1998
64views more  MOC 1998»
14 years 9 months ago
Trapezoidal and midpoint splittings for initial-boundary value problems
In this paper we consider various multi-component splittings based on the trapezoidal rule and the implicit midpoint rule. It will be shown that an important requirement on such me...
Willem Hundsdorfer
GECCO
2008
Springer
124views Optimization» more  GECCO 2008»
14 years 10 months ago
Aiming for a theoretically tractable CSA variant by means of empirical investigations
Evolution Strategies (ES) for black-box optimization of a function f : Rn → R are investigated. Namely, we consider the cumulative step-size adaptation (CSA) for the variance of...
Jens Jägersküpper, Mike Preuss
71
Voted
BIRD
2008
Springer
119views Bioinformatics» more  BIRD 2008»
14 years 11 months ago
Implementation of a Swap Matching Algorithm Using a Graph Theoretic Model
The swap matching problem consists if finding a pattern in a text, while allowing for transpositions in the pattern. A new approach using a graph-theoretic model was presented in [...
Pavlos Antoniou, Costas S. Iliopoulos, Inuka Jayas...