Sciweavers

2252 search results - page 387 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
ATAL
2008
Springer
13 years 11 months ago
Controlling deliberation in a Markov decision process-based agent
Meta-level control manages the allocation of limited resources to deliberative actions. This paper discusses efforts in adding meta-level control capabilities to a Markov Decision...
George Alexander, Anita Raja, David J. Musliner
TROB
2008
118views more  TROB 2008»
13 years 8 months ago
Connectedness Preserving Distributed Swarm Aggregation for Multiple Kinematic Robots
Abstract-- A distributed swarm aggregation algorithm is developed for a team of multiple kinematic agents. Specifically, each agent is assigned with a control law which is the sum ...
Dimos V. Dimarogonas, Kostas J. Kyriakopoulos
JMLR
2010
149views more  JMLR 2010»
13 years 3 months ago
Learning Bayesian Network Structure using LP Relaxations
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
Tommi Jaakkola, David Sontag, Amir Globerson, Mari...
FOGA
2011
13 years 11 days ago
Approximating the distribution of fitness over hamming regions
The distribution of fitness values across a set of states sharply influences the dynamics of evolutionary processes and heuristic search in combinatorial optimization. In this p...
Andrew M. Sutton, Darrell Whitley, Adele E. Howe
TON
2010
157views more  TON 2010»
13 years 3 months ago
Random Access Game and Medium Access Control Design
We study the contention/interaction among wireless nodes and med -ium access control design in game theory framework. We define a general class of games, called random access game...
Lijun Chen, Steven H. Low, John C. Doyle