71 search results - page 7 / 15 » On the Complexity of Reliable Root Approximation |
WDAG
1995
Springer
13 years 11 months ago
1995
Springer
Larchant-RDOSS is a distributed shared memory that persists on reliable storage across process lifetimes. Memory management is automatic: including consistent caching of data and ...
ASPLOS
2011
ACM
12 years 11 months ago
2011
ACM
Diagnosing software failures in the field is notoriously difficult, in part due to the fundamental complexity of trouble-shooting any complex software system, but further exacer...
COMPGEOM
2008
ACM
13 years 9 months ago
2008
ACM
The Delaunay triangulation and its dual the Voronoi diagram are ubiquitous geometric complexes. From a topological standpoint, the connection has recently been made between these ...
GLOBECOM
2006
IEEE
14 years 1 months ago
2006
IEEE
—Several dynamic call admission control (CAC) schemes for cellular networks have been proposed in the literature to reserve resources adaptively to provide the desired quality of...
COCO
1994
Springer
13 years 11 months ago
1994
Springer
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...