Sciweavers

15727 search results - page 2849 / 3146
» Software Engineering - Introduction
Sort
View
DAC
2009
ACM
16 years 5 months ago
Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...
Himanshu Jain, Edmund M. Clarke
DAC
2008
ACM
16 years 5 months ago
Path smoothing via discrete optimization
A fundamental problem in timing-driven physical synthesis is the reduction of critical paths in a design. In this work, we propose a powerful new technique that moves (and can als...
Michael D. Moffitt, David A. Papa, Zhuo Li, Charle...
DAC
2008
ACM
16 years 5 months ago
Parallelizing CAD: a timely research agenda for EDA
The relative decline of single-threaded processor performance, coupled with the ongoing shift towards on chip parallelism requires that CAD applications run efficiently on paralle...
Bryan C. Catanzaro, Kurt Keutzer, Bor-Yiing Su
DAC
2005
ACM
16 years 5 months ago
Simulation based deadlock analysis for system level designs
In the design of highly complex, heterogeneous, and concurrent systems, deadlock detection and resolution remains an important issue. In this paper, we systematically analyze the ...
Xi Chen, Abhijit Davare, Harry Hsieh, Alberto L. S...
WWW
2009
ACM
16 years 5 months ago
idMesh: graph-based disambiguation of linked data
We tackle the problem of disambiguating entities on the Web. We propose a user-driven scheme where graphs of entities ? represented by globally identifiable declarative artifacts ...
Hermann de Meer, Karl Aberer, Michael Jost, Parisa...
« Prev « First page 2849 / 3146 Last » Next »