Sciweavers

6274 search results - page 813 / 1255
» Proofs, Programs, Processes
Sort
View
ICML
1998
IEEE
16 years 7 months ago
Intra-Option Learning about Temporally Abstract Actions
tion Learning about Temporally Abstract Actions Richard S. Sutton Department of Computer Science University of Massachusetts Amherst, MA 01003-4610 rich@cs.umass.edu Doina Precup D...
Richard S. Sutton, Doina Precup, Satinder P. Singh
SPAA
2009
ACM
16 years 7 months ago
The weakest failure detector for wait-free dining under eventual weak exclusion
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
Srikanth Sastry, Scott M. Pike, Jennifer L. Welch
MOBISYS
2009
ACM
16 years 7 months ago
SoundSense: scalable sound sensing for people-centric applications on mobile phones
Top end mobile phones include a number of specialized (e.g., accelerometer, compass, GPS) and general purpose sensors (e.g., microphone, camera) that enable new people-centric sen...
Hong Lu, Wei Pan, Nicholas D. Lane, Tanzeem Choudh...
EDBT
2008
ACM
159views Database» more  EDBT 2008»
16 years 7 months ago
P2P systems with transactional semantics
Structured P2P systems have been developed for constructing applications at internet scale in cooperative environments and exhibit a number of desirable features such as scalabili...
Shyam Antony, Divyakant Agrawal, Amr El Abbadi
COCO
2009
Springer
131views Algorithms» more  COCO 2009»
16 years 1 months ago
A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
Joshua Brody, Amit Chakrabarti