Sciweavers

28 search results - page 4 / 6
» An Exponential Model for Infinite Rankings
Sort
View
IJRR
2010
115views more  IJRR 2010»
13 years 4 months ago
Improving the Efficiency of Clearing with Multi-agent Teams
We present an anytime algorithm for coordinating multiple autonomous searchers to find a potentially adversarial target on a graphical representation of a physical environment. Th...
Geoffrey Hollinger, Sanjiv Singh, Athanasios Kehag...
WSC
2007
13 years 9 months ago
Alternative thread scoring methods in qualitative event graphs
Event Graphs (EGs) and Simulation Graph Models provide a powerful and general modeling framework for discrete event simulation. Qualitative Event Graphs (QEGs) extend the EG frame...
Ricki G. Ingalls, Douglas J. Morrice
GECCO
2006
Springer
152views Optimization» more  GECCO 2006»
13 years 11 months ago
Strong recombination, weak selection, and mutation
We show that there are unimodal fitness functions and genetic algorithm (GA) parameter settings where the GA, when initialized with a random population, will not move close to the...
Alden H. Wright, J. Neal Richter
UAI
2000
13 years 8 months ago
PEGASUS: A policy search method for large MDPs and POMDPs
We propose a new approach to the problem of searching a space of policies for a Markov decision process (MDP) or a partially observable Markov decision process (POMDP), given a mo...
Andrew Y. Ng, Michael I. Jordan
ICC
2007
IEEE
136views Communications» more  ICC 2007»
14 years 1 months ago
Multiple-Symbol Differential Detection Based on Combinatorial Geometry
— In this paper, the application of combinatorial geometry to noncoherent multiple–symbol differential detection (MSDD) is considered. The resulting algorithm is referred to as...
Volker Pauli, Lutz H.-J. Lampe, Robert Schober, Ko...