Sciweavers

19 search results - page 3 / 4
» Efficient Algorithms for Optimum Cycle Mean and Optimum Cost...
Sort
View
PIMRC
2010
IEEE
13 years 3 months ago
Low-complexity admission control for distributed power-controlled networks with stochastic channels
This study addresses the general problem of efficient resource management in wireless networks with arbitrary timevarying topologies. Communication channels are assumed to generall...
Stepán Kucera, Bing Zhang
JMLR
2006
117views more  JMLR 2006»
13 years 5 months ago
On the Complexity of Learning Lexicographic Strategies
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
Michael Schmitt, Laura Martignon
AAAI
2012
11 years 8 months ago
Dynamic Matching via Weighted Myopia with Application to Kidney Exchange
In many dynamic matching applications—especially high-stakes ones—the competitive ratios of prior-free online algorithms are unacceptably poor. The algorithm should take distr...
John P. Dickerson, Ariel D. Procaccia, Tuomas Sand...
SAT
2010
Springer
172views Hardware» more  SAT 2010»
13 years 4 months ago
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
Denis Pankratov, Allan Borodin
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
13 years 5 months ago
Near-optimal algorithms for shared filter evaluation in data stream systems
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...