Sciweavers

1254 search results - page 98 / 251
» Making Hard Problems Harder
Sort
View
SENSYS
2010
ACM
13 years 8 months ago
Meeting ecologists' requirements with adaptive data acquisition
Ecologists instrument ecosystems to collect time series representing the evolution in time and space of relevant abiotic and biotic factors. Sensor networks promise to improve on ...
Marcus Chang, Philippe Bonnet
ATAL
2011
Springer
12 years 10 months ago
Towards a unifying characterization for quantifying weak coupling in dec-POMDPs
Researchers in the field of multiagent sequential decision making have commonly used the terms “weakly-coupled” and “loosely-coupled” to qualitatively classify problems i...
Stefan J. Witwicki, Edmund H. Durfee
MOBICOM
2012
ACM
12 years 17 days ago
Temporal reachability graphs
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...
John Whitbeck, Marcelo Dias de Amorim, Vania Conan...
PODC
2012
ACM
12 years 17 days ago
The cost of fault tolerance in multi-party communication complexity
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
Binbin Chen, Haifeng Yu, Yuda Zhao, Phillip B. Gib...
WWW
2009
ACM
14 years 10 months ago
Bid optimization for broad match ad auctions
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...
Eyal Even-Dar, Vahab S. Mirrokni, S. Muthukrishnan...