Sciweavers

288 search results - page 15 / 58
» A distributed algorithm for anytime coalition structure gene...
Sort
View
AINA
2008
IEEE
14 years 2 months ago
Protein Structure Comparison and Alignment Using Residue Contexts
We introduce a method for comparing protein structures using the notion of residue contexts based on protein Cα-atom backbones. The residue context is derived from the set of vec...
Tobias Sayre, Rahul Singh
ATAL
2003
Springer
14 years 22 days ago
A method for decentralized clustering in large multi-agent systems
This paper examines a method of clustering within a fully decentralized multi-agent system. Our goal is to group agents with similar objectives or data, as is done in traditional ...
Elth Ogston, Benno J. Overeinder, Maarten van Stee...
COLT
1994
Springer
13 years 11 months ago
Learning Probabilistic Automata with Variable Memory Length
We propose and analyze a distribution learning algorithm for variable memory length Markov processes. These processes can be described by a subclass of probabilistic nite automata...
Dana Ron, Yoram Singer, Naftali Tishby
EC
2006
195views ECommerce» more  EC 2006»
13 years 7 months ago
Automated Global Structure Extraction for Effective Local Building Block Processing in XCS
Learning Classifier Systems (LCSs), such as the accuracy-based XCS, evolve distributed problem solutions represented by a population of rules. During evolution, features are speci...
Martin V. Butz, Martin Pelikan, Xavier Llorà...
UAI
2003
13 years 8 months ago
Large-Sample Learning of Bayesian Networks is NP-Hard
In this paper, we provide new complexity results for algorithms that learn discrete-variable Bayesian networks from data. Our results apply whenever the learning algorithm uses a ...
David Maxwell Chickering, Christopher Meek, David ...