Sciweavers

7106 search results - page 938 / 1422
» Restricted Complexity, General Complexity
Sort
View
TACAS
2009
Springer
128views Algorithms» more  TACAS 2009»
16 years 1 months ago
All-Termination(T)
We introduce the All-Termination(T) problem: given a termination solver, T, and a program (a set of functions), find every set of formal arguments whose consideration is sufficie...
Panagiotis Manolios, Aaron Turon
DATE
2009
IEEE
86views Hardware» more  DATE 2009»
16 years 1 months ago
A formal approach to design space exploration of protocol converters
In the field of chip design, hardware module reuse is a standard solution to the increasing complexity of chip architecture and the pressures to reduce time to market. In the abs...
Karin Avnit, Arcot Sowmya
GLVLSI
2009
IEEE
122views VLSI» more  GLVLSI 2009»
16 years 1 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
GLVLSI
2009
IEEE
154views VLSI» more  GLVLSI 2009»
16 years 1 months ago
Design of a maximum-likelihood detector for cooperative communications in intersymbol interference channels
Recently, cooperative communication has attracted a lot of attention for its potential to increase spatial diversity. However, limited attention has been paid to the physical laye...
Yanjie Peng, Andrew G. Klein, Xinming Huang
ICAC
2009
IEEE
16 years 1 months ago
Model-driven architectural monitoring and adaptation for autonomic systems
Architectural monitoring and adaptation allows self-management capabilities of autonomic systems to realize more powerful adaptation steps, which observe and adjust not only param...
Thomas Vogel, Stefan Neumann, Stephan Hildebrandt,...