Sciweavers

4565 search results - page 592 / 913
» Time Optimal Self-Stabilizing Algorithms
Sort
View
155
Voted
PE
2002
Springer
124views Optimization» more  PE 2002»
15 years 3 months ago
Continuous-time hidden Markov models for network performance evaluation
In this paper, we study the use of continuous-time hidden Markov models (CT-HMMs) for network protocol and application performance evaluation. We develop an algorithm to infer the...
Wei Wei, Bing Wang, Donald F. Towsley
134
Voted
ATMOS
2010
308views Optimization» more  ATMOS 2010»
15 years 2 months ago
The Team Orienteering Problem: Formulations and Branch-Cut and Price
The Team Orienteering Problem is a routing problem on a graph with durations associated to the arcs and profits assigned to visiting the vertices. A fixed number of identical ve...
Marcus Poggi de Aragão, Henrique Viana, Edu...
INFOCOM
2010
IEEE
15 years 1 months ago
Delay-Based Network Utility Maximization
—It is well known that max-weight policies based on a queue backlog index can be used to stabilize stochastic networks, and that similar stability results hold if a delay index i...
Michael J. Neely
136
Voted
TMM
2011
169views more  TMM 2011»
14 years 10 months ago
Empowering Visual Categorization With the GPU
—Visual categorization is important to manage large collections of digital images and video, where textual metadata is often incomplete or simply unavailable. The bag-of-words mo...
Koen E. A. van de Sande, Theo Gevers, Cees G. M. S...
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
15 years 8 months ago
Almost optimum placement legalization by minimum cost flow and dynamic programming
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
Ulrich Brenner, Anna Pauli, Jens Vygen