Sciweavers

932 search results - page 148 / 187
» Where in the Wikipedia Is That Answer
Sort
View
ATAL
2003
Springer
14 years 28 days ago
Generalizing preference elicitation in combinatorial auctions
Combinatorial auctions where agents can bid on bundles of items are desirable because they allow the agents to express complementarity and substitutability between the items. Howe...
Benoît Hudson, Tuomas Sandholm
STACS
2001
Springer
14 years 4 days ago
A Toolkit for First Order Extensions of Monadic Games
In 1974 R. Fagin proved that properties of structures which are in NP are exactly the same as those expressible by existential second order sentences, that is sentences of the form...
David Janin, Jerzy Marcinkowski
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
14 years 1 days ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie
CORR
2010
Springer
101views Education» more  CORR 2010»
13 years 6 months ago
Spectrum Sharing as Spatial Congestion Games
—In this paper, we present and analyze the properties of a new class of games - the spatial congestion game (SCG), which is a generalization of the classical congestion game (CG)...
Sahand Haji Ali Ahmad, Cem Tekin, Mingyan Liu, Ric...
COLT
2010
Springer
13 years 5 months ago
Quantum Predictive Learning and Communication Complexity with Single Input
We define a new model of quantum learning that we call Predictive Quantum (PQ). This is a quantum analogue of PAC, where during the testing phase the student is only required to a...
Dmitry Gavinsky