Sciweavers

10608 search results - page 230 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
83
Voted
TON
2008
99views more  TON 2008»
15 years 10 days ago
On the computational complexity and effectiveness of N-hub shortest-path routing
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
Reuven Cohen, Gabi Nakibly
100
Voted
TSMC
2008
94views more  TSMC 2008»
15 years 10 days ago
Test Sequencing in Complex Manufacturing Systems
Testing complex manufacturing systems, such as an ASML [1] lithographic machine, takes up to 45% of the total development time of a system. The problem of which tests must be execu...
R. Boumen, I. S. M. de Jong, J. W. H. Vermunt, J. ...
94
Voted
TSP
2008
99views more  TSP 2008»
15 years 10 days ago
Low-Complexity Block Turbo Equalization for OFDM Systems in Time-Varying Channels
We propose low-complexity block turbo equalizers for orthogonal frequency-division multiplexing (OFDM) systems in time-varying channels. The presented work is based on a soft minim...
Kun Fang, Luca Rugini, Geert Leus
107
Voted
SAGT
2010
Springer
191views Game Theory» more  SAGT 2010»
14 years 10 months ago
Complexity of Safe Strategic Voting
We investigate the computational aspects of safe manipulation, a new model of coalitional manipulation that was recently put forward by Slinko and White [11]. In this model, a pot...
Noam Hazon, Edith Elkind
TCS
2010
14 years 10 months ago
On the complexities of consistency checking for restricted UML class diagrams
Automatic debugging of UML class diagrams helps in the visual specification of software systems because users cannot detect errors in logical consistency easily. This paper focus...
Ken Kaneiwa, Ken Satoh