Sciweavers

680 search results - page 26 / 136
» Complexity of Strict Implication
Sort
View
SIGECOM
1999
ACM
136views ECommerce» more  SIGECOM 1999»
13 years 12 months ago
Automated strategy searches in an electronic goods market: learning and complex price schedules
Markets for electronic goods provide the possibility of exploring new and more complex pricing schemes, due to the flexibility of information goods and negligible marginal cost. I...
Christopher H. Brooks, Scott A. Fay, Rajarshi Das,...
COCO
2009
Springer
124views Algorithms» more  COCO 2009»
14 years 2 months ago
The Maximum Communication Complexity of Multi-Party Pointer Jumping
—We study the one-way number-on-the-forhead (NOF) communication complexity of the k-layer pointer jumping problem. Strong lower bounds for this problem would have important impli...
Joshua Brody
ICASSP
2008
IEEE
14 years 2 months ago
Stability analysis of complex maximum likelihood ica using Wirtinger calculus
The desirable asymptotic optimality properties of the maximum likelihood (ML) estimator make it an attractive solution for performing independent component analysis (ICA) as well....
Hualiang Li, Tülay Adali
JMLR
2006
117views more  JMLR 2006»
13 years 7 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
STACS
2010
Springer
14 years 2 months ago
The Complexity of Approximating Bounded-Degree Boolean #CSP
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsen...