Sciweavers

6274 search results - page 200 / 1255
» From query complexity to computational complexity
Sort
View
96
Voted
ICS
2010
Tsinghua U.
15 years 8 months ago
Robust Perfect Revenue From Perfectly Informed Players
: Maximizing revenue in the presence of perfectly informed players is a well known goal in mechanism design. Yet, all current mechanisms for this goal are vulnerable to equilibrium...
Jing Chen, Avinatan Hassidim, Silvio Micali
111
Voted
IANDC
2007
84views more  IANDC 2007»
15 years 4 months ago
The perfectly synchronized round-based model of distributed computing
ectly-synchronized round-based model provides the powerful abstraction of op failures with atomic and synchronous message delivery. This abstraction makes distributed programming ...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...
DAGSTUHL
2003
15 years 6 months ago
The Autotelic Principle
— The paper focuses on the problem how a community of distributed agents may autonomously invent and coordinate lexicons and grammars. Although our earlier experiments have shown...
Luc Steels
160
Voted
ICASSP
2011
IEEE
14 years 8 months ago
Rank-deficient quadratic-form maximization over M-phase alphabet: Polynomial-complexity solvability and algorithmic developments
The maximization of a positive (semi)definite complex quadratic form over a finite alphabet is NP-hard and achieved through exhaustive search when the form has full rank. Howeve...
Anastasios T. Kyrillidis, George N. Karystinos
145
Voted
ICPR
2006
IEEE
16 years 5 months ago
DTM Generation from LIDAR Data using Skewness Balancing
LIght Detection And Ranging (LIDAR) data for terrain and land surveying has contributed to many environmental, engineering and civil applications. However, the analysis of Digital...
David C. Mason, Hong Wei, Marc Bartels