Sciweavers

5183 search results - page 344 / 1037
» The Complexity of Distributions
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
A Bernoulli-Gaussian model for gene factor analysis
This paper investigates a Bayesian model and a Markov chain Monte Carlo (MCMC) algorithm for gene factor analysis. Each sample in the dataset is decomposed as a linear combination...
Cecile Bazot, Nicolas Dobigeon, Jean-Yves Tournere...
E4MAS
2006
Springer
15 years 10 months ago
Exploiting the Environment for Coordinating Agent Intentions
One large and quite interesting family of MAS applications is characterized (1) by their large scale in terms of number of agents and physical distribution, (2) by their very dynam...
Tom Holvoet, Paul Valckenaers
ATAL
2010
Springer
15 years 7 months ago
Manipulation of copeland elections
We resolve an open problem regarding the complexity of unweighted coalitional manipulation, namely, the complexity of Copeland -manipulation for {0, 1}. Copeland , 0 1, is an...
Piotr Faliszewski, Edith Hemaspaandra, Henning Sch...
ATAL
2010
Springer
15 years 7 months ago
How important are updating schemes in multi-agent systems? An illustration on a multi-turmite model
It is to date an open question to know how the updating methods affect the evolution of a multi-agent system. This question has been tackled for various complex systems such as ce...
Nazim Fatès, Vincent Chevrier
COCO
2005
Springer
123views Algorithms» more  COCO 2005»
16 years 7 days ago
If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma