505 search results - page 38 / 101 » On the Minimality and Decomposability of Constraint Networks |
FMCAD
2007
Springer
14 years 2 months ago
2007
Springer
We present a formulation of retiming to minimize the number of registers in a design by iterating a maximum network flow problem. The retiming returned will be the optimum one whi...
ISPD
2004
ACM
14 years 1 months ago
2004
ACM
Considering the voltage drop constraint over a distributed model for power/ground (P/G) network, we study the following two problems for physical synthesis of sleep transistors: t...
KDD
2007
ACM
14 years 9 months ago
2007
ACM
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
AGENTS
1998
Springer
14 years 22 days ago
1998
Springer
Deep Space One will be the rst spacecraft to be controlled by an autonomous agent potentially capable of carrying out a complete mission with minimal commandingfrom Earth. The New...
DIALM
2005
ACM
13 years 10 months ago
2005
ACM
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...