Sciweavers

2286 search results - page 450 / 458
» Algorithms for Categorical Equivalence
Sort
View
ATAL
2010
Springer
14 years 10 months ago
Pure Nash equilibria: complete characterization of hard and easy graphical games
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
Albert Xin Jiang, MohammadAli Safari
88
Voted
GECCO
2008
Springer
143views Optimization» more  GECCO 2008»
14 years 10 months ago
How social structure and institutional order co-evolve beyond instrumental rationality
This study proposes an agent-based model where adaptively learning agents with local vision who are situated in the Prisoner’s Dilemma game change their strategy and location as...
Jae-Woo Kim
ICASSP
2010
IEEE
14 years 9 months ago
Automatic matched filter recovery via the audio camera
The sound reaching the acoustic sensor in a realistic environment contains not only the part arriving directly from the sound source but also a number of environmental re ections....
Adam O'Donovan, Ramani Duraiswami, Dmitry N. Zotki...
BMCBI
2010
121views more  BMCBI 2010»
14 years 9 months ago
MS4 - Multi-Scale Selector of Sequence Signatures: An alignment-free method for classification of biological sequences
Background: While multiple alignment is the first step of usual classification schemes for biological sequences, alignment-free methods are being increasingly used as alternatives...
Eduardo Corel, Florian Pitschi, Ivan Laprevotte, G...
CORR
2010
Springer
135views Education» more  CORR 2010»
14 years 9 months ago
Information Distance
While Kolmogorov complexity is the accepted absolute measure of information content in an individual finite object, a similarly absolute notion is needed for the information distan...
Charles H. Bennett, Péter Gács, Ming...