Sciweavers

2254 search results - page 445 / 451
» Computing the minimal covering set
Sort
View
AAAI
2007
15 years 2 months ago
Concurrent Action Execution with Shared Fluents
Concurrent action execution is important for plan-length minimization. However, action specifications are often limited to avoid conflicts arising from precondition/effect inter...
Michael Buro, Alexander Kovarsky
ESA
2008
Springer
148views Algorithms» more  ESA 2008»
15 years 1 months ago
Selfish Bin Packing
Following recent interest in the study of computer science problems in a game theoretic setting, we consider the well known bin packing problem where the items are controlled by se...
Leah Epstein, Elena Kleiman
NIPS
2000
15 years 1 months ago
Learning Continuous Distributions: Simulations With Field Theoretic Priors
Learning of a smooth but nonparametric probability density can be regularized using methods of Quantum Field Theory. We implement a field theoretic prior numerically, test its eff...
Ilya Nemenman, William Bialek
MOBICOM
2010
ACM
14 years 12 months ago
ZiFi: wireless LAN discovery via ZigBee interference signatures
WiFi networks have enjoyed an unprecedent penetration rate in recent years. However, due to the limited coverage, existing WiFi infrastructure only provides intermittent connectiv...
Ruogu Zhou, Yongping Xiong, Guoliang Xing, Limin S...
SIGCOMM
2010
ACM
14 years 12 months ago
Design and implementation of an "approximate" communication system for wireless media applications
All practical wireless communication systems are prone to errors. At the symbol level such wireless errors have a well-defined structure: when a receiver decodes a symbol erroneou...
Sayandeep Sen, Syed Gilani, Shreesha Srinath, Step...