Sciweavers

2128 search results - page 398 / 426
» A general characterization of indulgence
Sort
View
WDAG
1990
Springer
80views Algorithms» more  WDAG 1990»
14 years 1 months ago
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
Ofer Biran, Shlomo Moran, Shmuel Zaks
ACMACE
2007
ACM
14 years 1 months ago
Tangible interfaces for real-time 3D virtual environments
Emergent game formats, such as machinima, that use game worlds as expressive 3D performance spaces have new expressive powers with an increase of the quality of their underlying g...
Ali Mazalek, Michael Nitsche
ATAL
2007
Springer
14 years 1 months ago
Model-based belief merging without distance measures
Merging operators try to define the beliefs of a group of agents according to the beliefs of each member of the group. Several model-based propositional belief merging operators h...
Verónica Borja Macías, Pilar Pozos P...
CASES
2007
ACM
14 years 1 months ago
Towards understanding architectural tradeoffs in MEMS closed-loop feedback control
Micro-Electro-Mechanical Systems (MEMS) combine lithographically formed mechanical structures with electrical elements to create physical systems that operate on the scale of micr...
Greg Hoover, Forrest Brewer, Timothy Sherwood
SIGMOD
2010
ACM
196views Database» more  SIGMOD 2010»
14 years 1 months ago
Connected substructure similarity search
Substructure similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical com...
Haichuan Shang, Xuemin Lin, Ying Zhang, Jeffrey Xu...