Sciweavers

1331 search results - page 240 / 267
» Complexity bounds for zero-test algorithms
Sort
View
GLVLSI
2009
IEEE
122views VLSI» more  GLVLSI 2009»
14 years 2 months ago
Enhancing SAT-based sequential depth computation by pruning search space
The sequential depth determines the completeness of bounded model checking in design verification. Recently, a SATbased method is proposed to compute the sequential depth of a de...
Yung-Chih Chen, Chun-Yao Wang
SIGECOM
2009
ACM
216views ECommerce» more  SIGECOM 2009»
14 years 2 months ago
Approximate mechanism design without money
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...
Ariel D. Procaccia, Moshe Tennenholtz
INFOCOM
2006
IEEE
14 years 1 months ago
Packet Pacing in Short Buffer Optical Packet Switched Networks
— In the absence of a cost-effective technology for storing optical signals, emerging optical packet switched (OPS) networks are expected to have severely limited buffering capab...
Vijay Sivaraman, Hossam A. ElGindy, David Moreland...
ISLPED
2006
ACM
122views Hardware» more  ISLPED 2006»
14 years 1 months ago
Dynamic thermal clock skew compensation using tunable delay buffers
—The thermal gradients existing in high-performance circuits may significantly affect their timing behavior, in particular, by increasing the skew of the clock net and/or alteri...
Ashutosh Chakraborty, Karthik Duraisami, Ashoka Vi...
ANCS
2005
ACM
14 years 1 months ago
High-throughput linked-pattern matching for intrusion detection systems
This paper presents a hardware architecture for highly efficient intrusion detection systems. In addition, a software tool for automatically generating the hardware is presented....
Zachary K. Baker, Viktor K. Prasanna