1802 search results - page 191 / 361 » Complexity Theory for Operators in Analysis |
158
click to vote
SIGECOM
2004
ACM
15 years 12 months ago
2004
ACM
We consider the parallels between the preference elicitation problem in combinatorial auctions and the problem of learning an unknown function from learning theory. We show that l...
198
click to vote
SIGECOM
2003
ACM
15 years 11 months ago
2003
ACM
We examine correlated equilibria in the recently introduced formalism of graphical games, a succinct representation for multiplayer games. We establish a natural and powerful rela...
171
click to vote
ATAL
2003
Springer
15 years 11 months ago
2003
Springer
Formal theories of multi-agent systems require a rich ontology for modelling the dynamics of social behaviour. In this paper a formal analysis of the social behaviour of individua...
204
click to vote
CICLING
2003
Springer
15 years 11 months ago
2003
Springer
The theory of realizational morphology presented by Stump in his influential book Inflectional Morphology (2001) describes the derivation of inflected surface forms from underly...
181
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...