Sciweavers

641 search results - page 11 / 129
» Branch and Bound Algorithm Selection by Performance Predicti...
Sort
View
ICCD
2002
IEEE
93views Hardware» more  ICCD 2002»
15 years 8 months ago
Speculative Trace Scheduling in VLIW Processors
VLIW processors are statically scheduled processors and their performance depends on the quality of the compiler’s scheduler. We propose a scheduling scheme where the applicatio...
Manvi Agarwal, S. K. Nandy, Jos T. J. van Eijndhov...
UAI
2004
15 years 1 months ago
A Complete Anytime Algorithm for Treewidth
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...
Vibhav Gogate, Rina Dechter
91
Voted
INFORMS
2008
241views more  INFORMS 2008»
14 years 11 months ago
Solving the Capacitated Local Access Network Design Problem
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
F. Sibel Salman, R. Ravi, John N. Hooker
WWW
2003
ACM
16 years 9 days ago
Predicting the Upper Bound of Web Traffic Volume Using a Multiple Time Scale Approach
This paper presents a prediction algorithm for estimating the upper bound of future Web traffic volume. Unlike traditional traffic predictions that are performed at a single time ...
Weibin Zhao, Henning Schulzrinne
85
Voted
CORR
2009
Springer
114views Education» more  CORR 2009»
14 years 9 months ago
Distributed Branching Bisimulation Minimization by Inductive Signatures
We present a new distributed algorithm for state space minimization modulo branching bisimulation. Like its predecessor it uses signatures for refinement, but the refinement proce...
Stefan Blom, Jaco van de Pol