Sciweavers

2631 search results - page 44 / 527
» Less is More
Sort
View
ISPD
2000
ACM
108views Hardware» more  ISPD 2000»
14 years 2 days ago
A hybrid dynamic/quadratic programming algorithm for interconnect tree optimization
In this paper, we present an algorithm for delay minimization of interconnect trees by simultaneous buffer insertion/sizing and wire sizing. The algorithm integrates the quadratic...
Yu-Yen Mo, Chris C. N. Chu
AAAI
2004
13 years 9 months ago
Domain Transmutation in Constraint Satisfaction Problems
We study local interchangeability of values in constraint networks based on a new approach where a single value in the domain of a variable can be treated as a combination of &quo...
James Bowen, Chavalit Likitvivatanavong
ICWN
2004
13 years 9 months ago
Improvements to Location-Aided Routing Through Directional Count Restrictions
We present an effective way to improve the quality of unicast routes determined by the LAR Box method. Our method uses the location information acquired by LAR itself to determine ...
Michael Colagrosso, Nathan Enochs, Tracy Camp
IJCAI
2003
13 years 9 months ago
Splitting the atom: A new approach to Neighbourhood Interchangeability in Constraint Satisfaction Problems
We investigate interchangeability of values in CSPs, based on an approach where a single value in the domain of a variable can be treated as a combination of “sub-values”. An ...
James Bowen, Chavalit Likitvivatanavong
NJC
2006
88views more  NJC 2006»
13 years 7 months ago
Optimizing Slicing of Formal Specifications by Deductive Verification
Slicing is a technique for extracting parts of programs or specifications with respect to certain criteria of interest. The extraction is carried out in such a way that properties ...
Ingo Brückner, Björn Metzler, Heike Wehr...