Sciweavers

4485 search results - page 556 / 897
» Equivalences on Observable Processes
Sort
View
ML
2002
ACM
121views Machine Learning» more  ML 2002»
15 years 6 months ago
Near-Optimal Reinforcement Learning in Polynomial Time
We present new algorithms for reinforcement learning, and prove that they have polynomial bounds on the resources required to achieve near-optimal return in general Markov decisio...
Michael J. Kearns, Satinder P. Singh
SAC
2002
ACM
15 years 6 months ago
Short inversions and conserved gene clusters
Two independent sets of recent observations on newly sequenced microbial genomes pertain to the prevalence of short inversion as a gene order rearrangement process and to the lack...
David Sankoff
CE
2008
86views more  CE 2008»
15 years 5 months ago
Free/libre open source software implementation in schools: Evidence from the field and implications for the future
This empirical paper shows how free/libre open source software (FLOSS) contributes to mutual and collaborative learning in an educational environment. Unlike proprietary software,...
Yu-Wei Lin, Enrico Zini
ICRA
2010
IEEE
69views Robotics» more  ICRA 2010»
15 years 5 months ago
Probabilistic shadow information spaces
— This paper introduces a Bayesian filter that is specifically designed for counting targets that move outside of the field of view while performing a sensor sweep. Informatio...
Jingjin Yu, Steven M. LaValle
JSAC
2008
95views more  JSAC 2008»
15 years 5 months ago
Cognitive Medium Access: Constraining Interference Based on Experimental Models
In this paper we design a cognitive radio that can coexist with multiple parallel WLAN channels while abiding by an interference constraint. The interaction between both systems is...
Stefan Geirhofer, Lang Tong, Brian M. Sadler