Sciweavers

23557 search results - page 4710 / 4712
» Distributed Computing - Introduction
Sort
View
SOSP
2007
ACM
14 years 4 months ago
Attested append-only memory: making adversaries stick to their word
Researchers have made great strides in improving the fault tolerance of both centralized and replicated systems against arbitrary (Byzantine) faults. However, there are hard limit...
Byung-Gon Chun, Petros Maniatis, Scott Shenker, Jo...
IFM
2007
Springer
129views Formal Methods» more  IFM 2007»
14 years 1 months ago
Slotted-Circus
Material Flow Abstraction of Manufacturing Systems. ‣Umberto Costa, Ivan de Medeiros Jr and Marcel Oliveira. Specification and Verification of a MPI Implementation for a MP-SoC...
Andrew Butterfield, Adnan Sherif, Jim Woodcock
COMPGEOM
2006
ACM
14 years 1 months ago
Locked and unlocked chains of planar shapes
We extend linkage unfolding results from the well-studied case of polygonal linkages to the more general case of linkages of polygons. More precisely, we consider chains of nonove...
Robert Connelly, Erik D. Demaine, Martin L. Demain...
COMPGEOM
2010
ACM
14 years 19 days ago
Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen
DSD
2002
IEEE
96views Hardware» more  DSD 2002»
14 years 15 days ago
Networks on Silicon: Blessing or Nightmare?
Continuing VLSI technology scaling raises several deep submicron (DSM) problems like relatively slow interconnect, power dissipation and distribution, and signal integrity. Those ...
Paul Wielage, Kees G. W. Goossens
« Prev « First page 4710 / 4712 Last » Next »