Sciweavers

6274 search results - page 368 / 1255
» From query complexity to computational complexity
Sort
View
186
Voted
SIGECOM
2010
ACM
184views ECommerce» more  SIGECOM 2010»
15 years 11 months ago
Computing pure strategy nash equilibria in compact symmetric games
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
Christopher Thomas Ryan, Albert Xin Jiang, Kevin L...
ECAI
2010
Springer
15 years 7 months ago
Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods
We study the problem of fairly dividing a set of goods amongst a group of agents, when those agents have preferences that are ordinal relations over alternative bundles of goods (r...
Sylvain Bouveret, Ulle Endriss, Jérôm...
PC
2002
189views Management» more  PC 2002»
15 years 6 months ago
Data management and transfer in high-performance computational grid environments
An emerging class of data-intensive applications involve the geographically dispersed extraction of complex scientific information from very large collections of measured or compu...
William E. Allcock, Joseph Bester, John Bresnahan,...
MICRO
2010
IEEE
173views Hardware» more  MICRO 2010»
15 years 4 months ago
Single-Chip Heterogeneous Computing: Does the Future Include Custom Logic, FPGAs, and GPGPUs?
To extend the exponential performance scaling of future chip multiprocessors, improving energy efficiency has become a first-class priority. Single-chip heterogeneous computing ha...
Eric S. Chung, Peter A. Milder, James C. Hoe, Ken ...
CICLING
2003
Springer
15 years 12 months ago
Computing with Realizational Morphology
The theory of realizational morphology presented by Stump in his influential book Inflectional Morphology (2001) describes the derivation of inflected surface forms from underly...
Lauri Karttunen