Sciweavers

2911 search results - page 472 / 583
» A Logic of Graph Constraints
Sort
View
ISPD
2000
ACM
113views Hardware» more  ISPD 2000»
15 years 5 months ago
Floorplan area minimization using Lagrangian relaxation
modules can be handled in constraint graphs efficiently. This Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplan...
Fung Yu Young, Chris C. N. Chu, W. S. Luk, Y. C. W...
127
Voted
ASPDAC
2010
ACM
637views Hardware» more  ASPDAC 2010»
14 years 10 months ago
A new graph-theoretic, multi-objective layout decomposition framework for double patterning lithography
As Double Patterning Lithography(DPL) becomes the leading candidate for sub-30nm lithography process, we need a fast and lithography friendly decomposition framework. In this pape...
Jae-Seok Yang, Katrina Lu, Minsik Cho, Kun Yuan, D...
NHM
2010
87views more  NHM 2010»
14 years 7 months ago
The coolest path problem
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
Martin Frank, Armin Fügenschuh, Michael Herty...
SIGSOFT
2007
ACM
16 years 1 months ago
Finding bugs efficiently with a SAT solver
We present an approach for checking code against rich specifications, based on existing work that consists of encoding the program in a relational logic and using a constraint sol...
Julian Dolby, Mandana Vaziri, Frank Tip
SIGMOD
2010
ACM
227views Database» more  SIGMOD 2010»
15 years 5 months ago
SecureBlox: customizable secure distributed data processing
We present SecureBlox, a declarative system that unifies a distributed query processor with a security policy framework. SecureBlox decouples security concerns from system speciļ...
William R. Marczak, Shan Shan Huang, Martin Braven...