Sciweavers

1554 search results - page 176 / 311
» Parameterized Complexity and Approximation Algorithms
Sort
View
143
Voted
SIGECOM
2008
ACM
152views ECommerce» more  SIGECOM 2008»
15 years 3 months ago
On characterizations of truthful mechanisms for combinatorial auctions and scheduling
We characterize truthful mechanisms in two multi-parameter domains. The first characterization shows that every mechanism for combinatorial auctions with two subadditive bidders t...
Shahar Dobzinski, Mukund Sundararajan
TWC
2008
148views more  TWC 2008»
15 years 3 months ago
ARMA Synthesis of Fading Channels
Computationally scalable and accurate estimation, prediction, and simulation of wireless communication channels is critical to the development of more adaptive transceiver algorith...
Hani Mehrpouyan, Steven D. Blostein
164
Voted
TKDE
2010
160views more  TKDE 2010»
15 years 1 months ago
Using Proximity Search to Estimate Authority Flow
—Authority flow and proximity search have been used extensively in measuring the association between entities in data graphs, ranging from the Web to relational and XML database...
Vagelis Hristidis, Yannis Papakonstantinou, Ramakr...
DIALM
2004
ACM
113views Algorithms» more  DIALM 2004»
15 years 8 months ago
Gathering correlated data in sensor networks
In this paper, we consider energy-efficient gathering of correlated data in sensor networks. We focus on single-input coding strategies in order to aggregate correlated data. For ...
Pascal von Rickenbach, Roger Wattenhofer
GECCO
2007
Springer
235views Optimization» more  GECCO 2007»
15 years 9 months ago
Expensive optimization, uncertain environment: an EA-based solution
Real life optimization problems often require finding optimal solution to complex high dimensional, multimodal problems involving computationally very expensive fitness function e...
Maumita Bhattacharya