Sciweavers

1024 search results - page 183 / 205
» Compositional Methods for Probabilistic Systems
Sort
View
AAAI
2007
13 years 10 months ago
Using Expectation Maximization to Find Likely Assignments for Solving CSP's
We present a new probabilistic framework for finding likely variable assignments in difficult constraint satisfaction problems. Finding such assignments is key to efficient sea...
Eric I. Hsu, Matthew Kitching, Fahiem Bacchus, She...
ATAL
2008
Springer
13 years 9 months ago
Coordination in ambiguity: coordinated active localization for multiple robots
In environments which possess relatively few features that enable a robot to unambiguously determine its location, global localization algorithms can result in multiple hypotheses...
Shivudu Bhuvanagiri, K. Madhava Krishna, Supreeth ...
ICMLA
2007
13 years 9 months ago
Soft Failure Detection Using Factorial Hidden Markov Models
In modern business, educational, and other settings, it is common to provide a digital network that interconnects hardware devices for shared access by the users (e.g., in an of...
Guillaume Bouchard, Jean-Marc Andreoli
NIPS
2004
13 years 9 months ago
Schema Learning: Experience-Based Construction of Predictive Action Models
Schema learning is a way to discover probabilistic, constructivist, predictive action models (schemas) from experience. It includes methods for finding and using hidden state to m...
Michael P. Holmes, Charles Lee Isbell Jr.
CEC
2007
IEEE
13 years 7 months ago
Entropy-based Memetic Particle Swarm Optimization for computing periodic orbits of nonlinear mappings
— The computation of periodic orbits of nonlinear mappings is very important for studying and better understanding the dynamics of complex systems. Evolutionary algorithms have s...
Y. G. Petalas, Konstantinos E. Parsopoulos, Michae...