Sciweavers

3020 search results - page 599 / 604
» Optimal partition trees
Sort
View
127
Voted
FOCS
1995
IEEE
15 years 3 months ago
Disjoint Paths in Densely Embedded Graphs
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
Jon M. Kleinberg, Éva Tardos
AAAI
2008
15 years 2 months ago
Computational Influence for Training and Entertainment
2) a set of abstract drama manager; 3) a model of player response to drama manager actions; and 4) an author-specified evaluation function. The drama manager's task is to sele...
David L. Roberts
DIALM
2005
ACM
125views Algorithms» more  DIALM 2005»
15 years 1 months ago
Minimizing interference in ad hoc and sensor networks
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
Thomas Moscibroda, Roger Wattenhofer
IJCAI
2007
15 years 1 months ago
A Study of Residual Supports in Arc Consistency
In an Arc Consistency (AC) algorithm, a residual support, or residue, is a support that has been stored during a previous execution of the procedure which determines if a value is ...
Christophe Lecoutre, Fred Hemery
NETWORKING
2008
15 years 1 months ago
The CPBT: A Method for Searching the Prefixes Using Coded Prefixes in B-Tree
Due to the increasing size of IP routing table and the growing rate of their lookups, many algorithms are introduced to achieve the required speed in table search and update or opt...
Mohammad Behdadfar, Hossein Saidi