Sciweavers

1565 search results - page 299 / 313
» Adaptive Support for Distributed Collaboration
Sort
View
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
14 years 7 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
IEEEPACT
2009
IEEE
14 years 2 months ago
CPROB: Checkpoint Processing with Opportunistic Minimal Recovery
—CPR (Checkpoint Processing and Recovery) is a physical register management scheme that supports a larger instruction window and higher average IPC than conventional ROB-style re...
Andrew D. Hilton, Neeraj Eswaran, Amir Roth
EDOC
2008
IEEE
14 years 1 months ago
Facebook Meets the Virtualized Enterprise
: “Web 2.0” and “cloud computing” are revolutionizing the way IT infrastructure is accessed and managed. Web 2.0 technologies such as blogs, wikis and social networking pla...
Roger Curry, Cameron Kiddle, Nayden Markatchev, Ro...
NOMS
2008
IEEE
118views Communications» more  NOMS 2008»
14 years 1 months ago
Policy-based self-management of hybrid ad hoc networks for dynamic channel configuration
— Wireless networks have become a ubiquitous reality and ever more surround our everyday activities. They form and disappear around us spontaneously and have become new means for...
Antonis M. Hadjiantonis, George Pavlou
ATAL
2005
Springer
14 years 28 days ago
Thespian: using multi-agent fitting to craft interactive drama
There has been a growing interest in designing multi-agent based interactive dramas. A key research challenge faced in the design of these systems is to support open-ended user in...
Mei Si, Stacy Marsella, David V. Pynadath