Sciweavers

2412 search results - page 227 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
AAMAS
2005
Springer
15 years 3 months ago
Learning and Exploiting Relative Weaknesses of Opponent Agents
Agents in a competitive interaction can greatly benefit from adapting to a particular adversary, rather than using the same general strategy against all opponents. One method of s...
Shaul Markovitch, Ronit Reger
140
Voted
SIGECOM
2004
ACM
93views ECommerce» more  SIGECOM 2004»
15 years 9 months ago
Strategic deliberation and truthful revelation: an impossibility result
In many market settings, agents do not know their preferences a priori. Instead, they may have to solve computationally complex optimization problems, query databases, or perform ...
Kate Larson, Tuomas Sandholm
EKAW
2006
Springer
15 years 7 months ago
SemSearch: A Search Engine for the Semantic Web
Semantic search promises to produce precise answers to user queries by taking advantage of the availability of explicit semantics of information in the context of the semantic web....
Yuangui Lei, Victoria S. Uren, Enrico Motta
122
Voted
CORR
2008
Springer
114views Education» more  CORR 2008»
15 years 4 months ago
The Equivalence of Semidefinite Relaxation MIMO Detectors for Higher-Order QAM
In multi-input multi-output (MIMO) detection, semidefinite relaxation (SDR) has been shown to be an efficient high-performance approach. For BPSK and QPSK, it has been found that S...
Wing-Kin Ma, Chao-Cheng Su, Joakim Jalden, Tsung-H...
UPP
2004
Springer
15 years 9 months ago
From Prescriptive Programming of Solid-State Devices to Orchestrated Self-organisation of Informed Matter
Abstract. Achieving real-time response to complex, ambiguous, highbandwidth data is impractical with conventional programming. Only the narrow class of compressible input-output ma...
Klaus-Peter Zauner