Sciweavers

534 search results - page 23 / 107
» One more bit is enough
Sort
View
SPIN
2004
Springer
14 years 1 months ago
Minimization of Counterexamples in SPIN
We propose an algorithm to find a counterexample to some property in a finite state program. This algorithm is derived from SPIN’s one, but it finds a counterexample faster th...
Paul Gastin, Pierre Moro, Marc Zeitoun
IMC
2010
ACM
13 years 5 months ago
Measurement and analysis of real-world 802.11 mesh networks
Despite many years of work in wireless mesh networks built using 802.11 radios, the performance and behavior of these networks in the wild is not well-understood. This lack of und...
Katrina LaCurts, Hari Balakrishnan
GECCO
2003
Springer
129views Optimization» more  GECCO 2003»
14 years 1 months ago
Inherent Fault Tolerance in Evolved Sorting Networks
This poster paper summarizes our research on fault tolerance arising as a by-product of the evolutionary computation process. Past research has shown evidence of robustness emergin...
Rob Shepherd, James A. Foster
COMPSAC
2008
IEEE
14 years 2 months ago
Parallel Table Lookup for Next Generation Internet
The rapid growth of Internet population leads to the shortage of IP addresses. The next generation IP protocol, IPv6, which extends the IP address length from 32 bits to 128 bits,...
Li-Che Hung, Yaw-Chung Chen
IPPS
2008
IEEE
14 years 2 months ago
Design of steering vectors for dynamically reconfigurable architectures
An architectural framework is studied that can perform dynamic reconfiguration. A basic objective is to dynamically reconfigure the architecture so that its configuration is well ...
Nick A. Mould, Brian F. Veale, John K. Antonio, Mo...