Sciweavers

2796 search results - page 336 / 560
» The coolest path problem
Sort
View
INFOCOM
1998
IEEE
15 years 10 months ago
QoS Routing in Networks with Uncertain Parameters
We consider the problem of routing connections with quality of service (QoS) requirements across networks when the information available for making routing decisions is inaccurate....
Dean H. Lorenz, Ariel Orda
EOR
2006
135views more  EOR 2006»
15 years 6 months ago
Principles of scatter search
Scatter search is an evolutionary method that has been successfully applied to hard optimization problems. The fundamental concepts and principles of the method were first propose...
Rafael Martí, Manuel Laguna, Fred Glover
VLSID
1999
IEEE
87views VLSI» more  VLSID 1999»
15 years 10 months ago
Digital Circuit Design for Minimum Transient Energy and a Linear Programming Method
This paper provides a theoretical basis for eliminating or reducing the energy consumption due to transients in a synchronous digital circuit. The transient energy is minimized wh...
Vishwani D. Agrawal, Michael L. Bushnell, Ganapath...
ICCAD
2000
IEEE
153views Hardware» more  ICCAD 2000»
15 years 10 months ago
Slope Propagation in Static Timing Analysis
ct Static timing analysis has traditionally used the PERT method for identifying the critical path of a digital circuit. Due to the influence of the slope of a signal at a particul...
David Blaauw, Vladimir Zolotov, Savithri Sundaresw...
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
16 years 6 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine