Sciweavers

1628 search results - page 296 / 326
» Dynamically Adaptive Parallel Programs
Sort
View
SARA
2007
Springer
14 years 1 months ago
Computing and Using Lower and Upper Bounds for Action Elimination in MDP Planning
Abstract. We describe a way to improve the performance of MDP planners by modifying them to use lower and upper bounds to eliminate non-optimal actions during their search. First, ...
Ugur Kuter, Jiaqiao Hu
VALUETOOLS
2006
ACM
176views Hardware» more  VALUETOOLS 2006»
14 years 1 months ago
How to solve large scale deterministic games with mean payoff by policy iteration
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
Vishesh Dhingra, Stephane Gaubert
CAISE
2005
Springer
14 years 1 months ago
Self-Organization in Overlay Networks
Abstract. Overlay networks are an important kind of P2P infrastructures. The range of applications and requirements is broad. Consequently, our research objective are overlay netwo...
Sven Apel, Klemens Böhm
GECCO
2005
Springer
142views Optimization» more  GECCO 2005»
14 years 1 months ago
Toward evolved flight
We present the first hardware-in-the-loop evolutionary optimization on an ornithopter. Our experiments demonstrate the feasibility of evolving flight through genetic algorithms an...
Rusty Hunt, Gregory Hornby, Jason D. Lohn
ICNP
2000
IEEE
13 years 12 months ago
Optimal Partitioning of Multicast Receivers
Multicast sessions may have a large number of receivers with heterogeneous reception capacities. To accommodate this heterogeneity, various multi-rate schemes, based upon the use ...
Yang Richard Yang, Min Sik Kim, Simon S. Lam