Sciweavers

1309 search results - page 79 / 262
» Approaching Optimality for Solving SDD Linear Systems
Sort
View
92
Voted
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
15 years 2 months ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger
83
Voted
CISSE
2009
Springer
14 years 8 months ago
Optimal Component Selection for Component-Based Systems
In Component-based Software (CBS) development, it is desirable to choose software components that provide all necessary functionalities and at the same time optimize certain nonfun...
Muhammad Ali Khan, Sajjad Mahmood
76
Voted
ICC
2007
IEEE
135views Communications» more  ICC 2007»
15 years 4 months ago
Adaptive Throughput Optimization for MIMO Systems in Rayleigh Fading Channels
—We consider the adaptive throughput optimization problem for multiple-input multiple-output (MIMO) systems in Rayleigh fading channels. With perfect channel knowledge at the tra...
Younggeun Cho, Min-Sung Kim, Fouad A. Tobagi
ACMICEC
2003
ACM
172views ECommerce» more  ACMICEC 2003»
15 years 3 months ago
Automated mechanism design: complexity results stemming from the single-agent setting
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism ...
Vincent Conitzer, Tuomas Sandholm
AUTOMATICA
2008
75views more  AUTOMATICA 2008»
14 years 10 months ago
Optimal complexity reduction of polyhedral piecewise affine systems
This paper focuses on the NP-hard problem of reducing the complexity of piecewise polyhedral systems (e.g. polyhedral piecewise affine (PWA) systems). The results are fourfold. Fi...
Tobias Geyer, Fabio Danilo Torrisi, Manfred Morari