3038 search results - page 445 / 608 » Industrial evolutionary computing |
150
click to vote
DAC
2007
ACM
16 years 7 months ago
2007
ACM
The ability of modern SAT solvers to produce proofs of unsatisfiability for Boolean formulas has become a powerful tool for EDA applications. Proofs are generated from a resolve t...
152
click to vote
DAC
1999
ACM
16 years 7 months ago
1999
ACM
Recently, several algorithms for interconnect optimization via repeater insertion and wire sizing have appeared based on the Elmore delay model. Using the Devgan noise metric [6] ...
187
click to vote
DAC
2004
ACM
16 years 7 months ago
2004
ACM
Bounded Model Checking (BMC) relies on solving a sequence of highly correlated Boolean satisfiability (SAT) problems, each of which corresponds to the existence of counter-example...
188
click to vote
CHI
2009
ACM
16 years 7 months ago
2009
ACM
Despite the growing interest in user experience (UX), it has been hard to gain a common agreement on the nature and scope of UX. In this paper, we report a survey that gathered th...
186
click to vote
CHI
2007
ACM
16 years 6 months ago
2007
ACM
This work draws on studies which explore resistance to the music industry's construal of copying music files as theft. Following a previous ethnography on participants' ...