Sciweavers

373 search results - page 21 / 75
» An ACO Algorithm for the Most Probable Explanation Problem
Sort
View
TALG
2008
97views more  TALG 2008»
13 years 8 months ago
Average-case lower bounds for the plurality problem
Given a set of n elements, each of which is colored one of c 2 colors, we must determine an element of the plurality (most frequently occurring) color by pairwise equal/unequal co...
Laurent Alonso, Edward M. Reingold
STACS
1993
Springer
14 years 4 days ago
The Complexity of Logic-Based Abduction
Abduction is an important form of nonmonotonic reasoning allowing one to find explanations for certain symptoms or manifestations. When the application domain is described by a l...
Thomas Eiter, Georg Gottlob
AGI
2008
13 years 9 months ago
A computational approximation to the AIXI model
Universal induction solves in principle the problem of choosing a prior to achieve optimal inductive inference. The AIXI theory, which combines control theory and universal induct...
Sergey Pankov
SAGA
2007
Springer
14 years 2 months ago
Communication Problems in Random Line-of-Sight Ad-Hoc Radio Networks
The line-of-sight networks is a network model introduced recently by Frieze et al. (SODA’07). It considers scenarios of wireless networks in which the underlying environment has...
Artur Czumaj, Xin Wang
CORR
2002
Springer
113views Education» more  CORR 2002»
13 years 7 months ago
Robust Global Localization Using Clustered Particle Filtering
Global mobile robot localization is the problem of determining a robot's pose in an environment, using sensor data, when the starting position is unknown. A family of probabi...
Javier Nicolás Sánchez, Adam Milstei...