286 search results - page 36 / 58 » Design of heat exchanger networks using randomized algorithm |
EUROCAST
2009
Springer
14 years 3 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
KIVS
2005
Springer
14 years 2 months ago
2005
Springer
Peer-to-peer overlay networks have grown significantly in size and sophistication over the last years. Meanwhile, distributed hash tables (DHT) provide efficient means to create g...
CONEXT
2009
ACM
13 years 10 months ago
2009
ACM
The behavior of routing protocols during convergence is critical as it impacts end-to-end performance. Network convergence is particularly important in BGP, the current interdomai...
SIGCOMM
2006
ACM
14 years 2 months ago
2006
ACM
Researchers have proposed a variety of metrics to measure important graph properties, for instance, in social, biological, and computer networks. Values for a particular graph met...
COLT
2006
Springer
14 years 22 days ago
2006
Springer
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...