Sciweavers

2695 search results - page 256 / 539
» The Complexity of Forecast Testing
Sort
View
141
Voted
LICS
2006
IEEE
15 years 10 months ago
Two-Variable Logic on Words with Data
— In a data word each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been already considered in the realm of semi...
Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentic...
TRIDENTCOM
2006
IEEE
15 years 10 months ago
EVEREST testbed: QoS management evaluation in B3G networks
This paper describes the motivation, methodology and implementation approach of the testbed that has been developed in the framework of the EVEREST project. Such testbed is used f...
Ramon Ferrús, Antoni Gelonch, Ferran Casade...
ACMSE
2006
ACM
15 years 10 months ago
A SAT-based solver for Q-ALL SAT
Although the satisfiability problem (SAT) is NP-complete, state-of-the-art solvers for SAT can solve instances that are considered to be very hard. Emerging applications demand t...
Ben Browning, Anja Remshagen
126
Voted
ASPDAC
2006
ACM
130views Hardware» more  ASPDAC 2006»
15 years 10 months ago
Convergence-provable statistical timing analysis with level-sensitive latches and feedback loops
Statistical timing analysis has been widely applied to predict the timing yield of VLSI circuits when process variations become significant. Existing statistical latch timing met...
Lizheng Zhang, Jeng-Liang Tsai, Weijen Chen, Yuhen...
139
Voted
ISLPED
2006
ACM
140views Hardware» more  ISLPED 2006»
15 years 10 months ago
L-CBF: a low-power, fast counting bloom filter architecture
—An increasing number of architectural techniques rely on hardware counting bloom filters (CBFs) to improve upon the enegy, delay and complexity of various processor structures. ...
Elham Safi, Andreas Moshovos, Andreas G. Veneris