Sciweavers

117 search results - page 11 / 24
» MOPping up Exceptions
Sort
View
SOSP
2001
ACM
14 years 4 months ago
Building a Robust Software-Based Router Using Network Processors
Recent efforts to add new services to the Internet have increased interest in software-based routers that are easy to extend and evolve. This paper describes our experiences using...
Tammo Spalink, Scott Karlin, Larry L. Peterson, Yi...
TIME
2009
IEEE
14 years 2 months ago
Model Checking CTL is Almost Always Inherently Sequential
The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the...
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heri...
SAT
2009
Springer
113views Hardware» more  SAT 2009»
14 years 2 months ago
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
Abstract. We offer a new understanding of some aspects of practical SAT-solvers that are based on DPLL with unit-clause propagation, clause-learning, and restarts. On the theoreti...
Albert Atserias, Johannes Klaus Fichte, Marc Thurl...
COMSWARE
2007
IEEE
14 years 2 months ago
Scalable Multicast Platforms for a New Generation of Robust Distributed Applications
1 As distributed systems scale up and are deployed into increasingly sensitive settings, demand is rising for a new generation of communications middleware in support of applicati...
Ken Birman, Mahesh Balakrishnan, Danny Dolev, Tudo...
ISVLSI
2007
IEEE
161views VLSI» more  ISVLSI 2007»
14 years 1 months ago
CMP-aware Maze Routing Algorithm for Yield Enhancement
— Chemical-Mechanical Polishing (CMP) is one of the key steps during nanometer VLSI manufacturing process where minimum variation of layout pattern densities is desired. This pap...
Hailong Yao, Yici Cai, Xianlong Hong