474 search results - page 68 / 95 » On Multicast Path Finding Algorithms |
JSS
2008
13 years 6 months ago
2008
This report presents a model-driven, stress test methodology aimed at increasing chances of discovering faults related to network traffic in Distributed Real-Time Systems (DRTS). T...
WINE
2010
Springer
13 years 5 months ago
2010
Springer
We consider profit-maximization problems for combinatorial auctions with non-single minded valuation functions and limited supply. We obtain fairly general results that relate the ...
ISPD
1999
ACM
14 years 1 hour ago
1999
ACM
—This paper studies a natural formulation of the timing-driven maze routing problem. A multigraph model appropriate for global routing applications is adopted; the model naturall...
ESA
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We prove that for every graph H, there exists a polynomial-time algorithm deciding if a planar graph can be contracted to H. We introduce contractions and topological min...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Hidden Markov models are traditionally decoded by the Viterbi algorithm which finds the highest probability state path in the model. In recent years, several limitations ...