Sciweavers

1353 search results - page 160 / 271
» Streamlined Constraint Reasoning
Sort
View
CPAIOR
2008
Springer
14 years 11 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann
IANDC
2008
105views more  IANDC 2008»
14 years 10 months ago
Symbolic protocol analysis for monoidal equational theories
We are interested in the design of automated procedures for analyzing the (in)security of cryptographic protocols in the Dolev-Yao model for a bounded number of sessions when we t...
Stéphanie Delaune, Pascal Lafourcade, Denis...
IJCAI
1997
14 years 11 months ago
Change, Change, Change: Three Approaches
We consider the frame problem, that is, char­ acterizing the assumption that properties tend to persist over time. We show that there are at least three distinct assumptions that...
Tom Costello
ICCAD
2004
IEEE
155views Hardware» more  ICCAD 2004»
15 years 6 months ago
A flexibility aware budgeting for hierarchical flow timing closure
—In this paper, we present a new block budgeting algorithm which speeds up timing closure in timing driven hierarchical flows. After a brief description of the addressed flow, ...
Olivier Omedes, Michel Robert, Mohammed Ramdani
ISPD
2010
ACM
195views Hardware» more  ISPD 2010»
15 years 4 months ago
Density gradient minimization with coupling-constrained dummy fill for CMP control
In the nanometer IC design, dummy fill is often performed to improve layout pattern uniformity and the post-CMP quality. However, filling dummies might greatly increase intercon...
Huang-Yu Chen, Szu-Jui Chou, Yao-Wen Chang