Sciweavers

341 search results - page 62 / 69
» Paired bondage in trees
Sort
View
IDA
2010
Springer
14 years 11 months ago
A Framework for Path-Oriented Network Simplification
Abstract. We propose a generic framework and methods for simplification of large networks. The methods can be used to improve the understandability of a given network, to complemen...
Hannu Toivonen, Sébastien Mahler, Fang Zhou
NSDI
2010
14 years 11 months ago
Hedera: Dynamic Flow Scheduling for Data Center Networks
Today's data centers offer tremendous aggregate bandwidth to clusters of tens of thousands of machines. However, because of limited port densities in even the highest-end swi...
Mohammad Al-Fares, Sivasankar Radhakrishnan, Barat...
86
Voted
IJCAI
2007
14 years 11 months ago
Using Linear Programming for Bayesian Exploration in Markov Decision Processes
A key problem in reinforcement learning is finding a good balance between the need to explore the environment and the need to gain rewards by exploiting existing knowledge. Much ...
Pablo Samuel Castro, Doina Precup
SODA
2008
ACM
96views Algorithms» more  SODA 2008»
14 years 11 months ago
Greedy drawings of triangulations
Greedy Routing is a class of routing algorithms in which the packets are forwarded in a manner that reduces the distance to the destination at every step. In an attempt to provide...
Raghavan Dhandapani
IJCAI
2003
14 years 11 months ago
Consistency and Set Intersection
We propose a new framework to study properties of consistency in a Constraint Network from the perspective of properties of set intersection. Our framework comes with a proof sche...
Yuanlin Zhang, Roland H. C. Yap