2796 search results - page 107 / 560 » The coolest path problem |
109
Voted
ICCAD
1999
IEEE
15 years 9 months ago
1999
IEEE
A delay abstraction of a combinational module is a compact representation of the delay information of the module, which carries effective pin-to-pin delay for each primary-input/pr...
144
Voted
IMC
2003
ACM
15 years 10 months ago
2003
ACM
Time-varying congestion on Internet paths and failures due to software, hardware, and configuration errors often disrupt packet delivery on the Internet. Many aproaches to avoidi...
156
click to vote
SODA
2010
ACM
16 years 2 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
167
Voted
ASIAN
1999
Springer
15 years 9 months ago
1999
Springer
Abstract. Ant Colony Optimization (ACO) is a paradigm that employs a set of cooperating agents to solve functions or obtain good solutions for combinatorial optimization problems. ...
134
click to vote
INFOCOM
2006
IEEE
15 years 11 months ago
2006
IEEE
— Multihoming has been used by stub networks for several years as a form of redundancy, improving the availability of Internet access. More recently, Intelligent Route Control (I...