Sciweavers

178 search results - page 32 / 36
» Bounds, Heuristics, and Approximations for Distribution Syst...
Sort
View
PPSN
2000
Springer
13 years 11 months ago
Optimizing through Co-evolutionary Avalanches
Abstract. We explore a new general-purpose heuristic for nding highquality solutions to hard optimization problems. The method, called extremal optimization, is inspired by self-or...
Stefan Boettcher, Allon G. Percus, Michelangelo Gr...
FOCS
2009
IEEE
14 years 2 months ago
Faster Generation of Random Spanning Trees
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
Jonathan A. Kelner, Aleksander Madry
VMV
2003
146views Visualization» more  VMV 2003»
13 years 9 months ago
ADB-Trees: Controlling the Error of Time-Critical Collision Detection
We present a novel framework for hierarchical collision detection that can be applied to virtually all bounding volume (BV) hierarchies. It allows an application to trade quality ...
Jan Klein, Gabriel Zachmann
ATAL
2008
Springer
13 years 9 months ago
A new perspective to the keepaway soccer: the takers
Keepaway is a sub-problem of RoboCup Soccer Simulator in which 'the keepers' try to maintain the possession of the ball, while 'the takers' try to steal the ba...
Atil Iscen, Umut Erogul
HICSS
2003
IEEE
207views Biometrics» more  HICSS 2003»
14 years 26 days ago
Formalizing Multi-Agent POMDP's in the context of network routing
This paper uses partially observable Markov decision processes (POMDP’s) as a basic framework for MultiAgent planning. We distinguish three perspectives: first one is that of a...
Bharaneedharan Rathnasabapathy, Piotr J. Gmytrasie...