Sciweavers

3946 search results - page 77 / 790
» The computational complexity of choice sets
Sort
View
AAAI
2006
15 years 1 months ago
On Strictly Competitive Multi-Player Games
We embark on an initial study of a new class of strategic (normal-form) games, so-called ranking games, in which the payoff to each agent solely depends on his position in a ranki...
Felix Brandt, Felix A. Fischer, Yoav Shoham
TASLP
2002
84views more  TASLP 2002»
14 years 11 months ago
Maximum likelihood multiple subspace projections for hidden Markov models
The first stage in many pattern recognition tasks is to generate a good set of features from the observed data. Usually, only a single feature space is used. However, in some compl...
Mark J. F. Gales
ICST
2011
IEEE
14 years 3 months ago
It is Not the Length That Matters, It is How You Control It
—The length of test cases is a little investigated topic in search-based test generation for object oriented software, where test cases are sequences of method calls. While intui...
Gordon Fraser, Andrea Arcuri
ASPDAC
2006
ACM
133views Hardware» more  ASPDAC 2006»
15 years 5 months ago
High-level architecture exploration for MPEG4 encoder with custom parameters
Abstract - this paper proposes the use of a high-level architecture exploration method for different MPEG4 video encoders using different customization parameters. The targeted arc...
Marius Bonaciu, Aimen Bouchhima, Mohamed-Wassim Yo...
IPTPS
2004
Springer
15 years 5 months ago
Uncoordinated Load Balancing and Congestion Games in P2P Systems
In P2P systems, users often have many choices of peers from whom to download their data. Each user cares primarily about its own response time, which depends on how many other use...
Subhash Suri, Csaba D. Tóth, Yunhong Zhou