Sciweavers

2131 search results - page 273 / 427
» A computational approximation to the AIXI model
Sort
View
ALGOSENSORS
2007
Springer
16 years 9 days ago
Counting Targets with Mobile Sensors in an Unknown Environment
Abstract. We consider the problem of counting the number of indistinguishable targets using a simple binary sensing model. Our setting includes an unknown number of point targets i...
Beat Gfeller, Matús Mihalák, Subhash...
203
Voted
AAAI
2012
13 years 8 months ago
Strategic Advice Provision in Repeated Human-Agent Interactions
This paper addresses the problem of automated advice provision in settings that involve repeated interactions between people and computer agents. This problem arises in many real ...
Amos Azaria, Zinovi Rabinovich, Sarit Kraus, Claud...
146
Voted
FOCS
2004
IEEE
15 years 9 months ago
The Hardness of Metric Labeling
The Metric Labeling problem is an elegant and powerful mathematical model capturing a wide range of classification problems. The input to the problem consists of a set of labels a...
Julia Chuzhoy, Joseph Naor
MOBIHOC
2009
ACM
16 years 6 months ago
Characterizing the exit process of a non-saturated IEEE 802.11 wireless network
In this paper, we consider a non-saturated IEEE 802.11 based wireless network. We use a three-way fixed point to model the node behavior with Bernoulli packet arrivals and determi...
Punit Rathod, Onkar Dabeer, Abhay Karandikar, Anir...
3DIM
2007
IEEE
16 years 14 days ago
Cached k-d tree search for ICP algorithms
The ICP (Iterative Closest Point) algorithm is the de facto standard for geometric alignment of threedimensional models when an initial relative pose estimate is available. The ba...
Andreas Nüchter, Kai Lingemann, Joachim Hertz...