Sciweavers

1289 search results - page 191 / 258
» Complexity of Counting the Optimal Solutions
Sort
View
SODA
2004
ACM
115views Algorithms» more  SODA 2004»
14 years 11 months ago
Minimizing the stabbing number of matchings, trees, and triangulations
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
Sándor P. Fekete, Marco E. Lübbecke, H...
CONEXT
2009
ACM
14 years 11 months ago
SWARM: the power of structure in community wireless mesh networks
Community wireless networks (CWNs) have been proposed to spread broadband network access to underprivileged, underprovisioned and remote areas. Research has focused on optimizing ...
Saumitra M. Das, Konstantina Papagiannaki, Suman B...
AAMAS
2008
Springer
14 years 10 months ago
Logic-based automated multi-issue bilateral negotiation in peer-to-peer e-marketplaces
Abstract. We present a novel logic-based framework to automate multi-issue bilateral negotiation in e-commerce settings. The approach exploits logic as communication language among...
Azzurra Ragone, Tommaso Di Noia, Eugenio Di Sciasc...
JIRS
2008
100views more  JIRS 2008»
14 years 9 months ago
Model-based Predictive Control of Hybrid Systems: A Probabilistic Neural-network Approach to Real-time Control
Abstract This paper proposes an approach for reducing the computational complexity of a model-predictive-control strategy for discrete-time hybrid systems with discrete inputs only...
Bostjan Potocnik, Gasper Music, Igor Skrjanc, Boru...
TIT
2008
65views more  TIT 2008»
14 years 9 months ago
Power-Efficient Resource Allocation for Time-Division Multiple Access Over Fading Channels
We investigate resource allocation policies for time-division multiple access (TDMA) over fading channels in the power-limited regime. For frequency-flat block-fading channels and ...
Xin Wang, Georgios B. Giannakis