Sciweavers

9716 search results - page 329 / 1944
» The Case for Energy-Proportional Computing
Sort
View
GC
2006
Springer
15 years 6 months ago
Alternating Paths along Axis-Parallel Segments
It is shown that for a set S of n pairwise disjoint axis-parallel line segments in the plane there is a simple alternating path of length ( n). This bound is best possible in the...
Csaba D. Tóth
LADC
2011
Springer
14 years 9 months ago
Timing Analysis of Leader-Based and Decentralized Byzantine Consensus Algorithms
—We compare in an analytical way two leader-based and decentralized algorithms (that is, algorithms that do not use a leader) for Byzantine consensus with strong validity. We sho...
Fatemeh Borran, Martin Hutle, André Schiper
MP
2002
86views more  MP 2002»
15 years 6 months ago
Multistars, partial multistars and the capacitated vehicle routing problem
In an unpublished paper, Araque, Hall and Magnanti considered polyhedra associated with the Capacitated Vehicle Routing Problem (CVRP) in the special case of unit demands. Among th...
Adam N. Letchford, Richard W. Eglese, Jens Lysgaar...
ICST
2009
IEEE
15 years 4 months ago
Timed Testing under Partial Observability
This paper studies the problem of model-based testing of real-time systems that are only partially observable. We model the System Under Test (SUT) using Timed Game Automata (TGA)...
Alexandre David, Kim Guldstrand Larsen, Shuhao Li,...
MOC
1998
85views more  MOC 1998»
15 years 6 months ago
Remarks on the Schoof-Elkies-Atkin algorithm
Abstract. Schoof’s algorithm computes the number m of points on an elliptic curve E defined over a finite field Fq. Schoof determines m modulo small primes using the character...
L. Dewaghe