914 search results - page 75 / 183 » Branch and Bound on the Network Model |
KDD
2002
ACM
15 years 10 months ago
2002
ACM
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...
WINE
2005
Springer
15 years 3 months ago
2005
Springer
We consider a class of networks where n agents need to send their traffic from a given source to a given destination over m identical, non-intersecting, and parallel links. For suc...
107
click to vote
BMCBI
2004
14 years 9 months ago
2004
Background: Functional genomics studies are yielding information about regulatory processes in the cell at an unprecedented scale. In the yeast S. cerevisiae, DNA microarrays have...
MST
2011
14 years 4 months ago
2011
In this paper we generalize the Continuous Adversarial Queuing Theory (CAQT) model [5] by considering the possibility that the router clocks in the network are not synchronized. W...
CORR
2011
Springer
14 years 1 months ago
2011
Springer
Most work on wireless network throughput ignores the temporal correlation inherent to wireless channels because it degrades tractability. To better model and quantify the temporal...