Sciweavers

1684 search results - page 147 / 337
» The lexicographic decision function
Sort
View
TSP
2010
14 years 10 months ago
Universal randomized switching
Abstract--In this paper, we consider a competitive approach to sequential decision problems, suitable for a variety of signal processing applications where at each of a succession ...
Suleyman Serdar Kozat, Andrew C. Singer
AAAI
2011
14 years 4 months ago
Market Manipulation with Outside Incentives
Much evidence has shown that prediction markets, when used in isolation, can effectively aggregate dispersed information about uncertain future events and produce remarkably accur...
Yiling Chen, Xi Alice Gao, Rick Goldstein, Ian A. ...
ICML
2009
IEEE
16 years 4 months ago
Predictive representations for policy gradient in POMDPs
We consider the problem of estimating the policy gradient in Partially Observable Markov Decision Processes (POMDPs) with a special class of policies that are based on Predictive ...
Abdeslam Boularias, Brahim Chaib-draa
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
16 years 4 months ago
On the complexity of communication complexity
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
Eyal Kushilevitz, Enav Weinreb
HICSS
2007
IEEE
110views Biometrics» more  HICSS 2007»
15 years 10 months ago
Which collaboration patterns are most challenging: A global survey of facilitators
Facilitation is a key success factor for effective Group Support Systems (GSS) applications. The development of effective support for facilitation becomes more critical than ever ...
Mariëlle den Hengst, Mark Adkins