Sciweavers

248 search results - page 34 / 50
» The Multi-Story Space Assignment Problem
Sort
View
AAAI
2008
14 years 1 months ago
Learning and Inference with Constraints
Probabilistic modeling has been a dominant approach in Machine Learning research. As the field evolves, the problems of interest become increasingly challenging and complex. Makin...
Ming-Wei Chang, Lev-Arie Ratinov, Nicholas Rizzolo...
HYBRID
1995
Springer
14 years 2 months ago
Deciding Reachability for Planar Multi-polynomial Systems
Abstract. In this paper we investigate the decidability of the reachability problem for planar non-linear hybrid systems. A planar hybrid system has the property that its state spa...
Karlis Cerans, Juris Viksna
ICMLA
2004
14 years 9 days ago
A new discrete binary particle swarm optimization based on learning automata
: The particle swarm is one of the most powerful methods for solving global optimization problems. This method is an adaptive algorithm based on social-psychological metaphor. A po...
Reza Rastegar, Mohammad Reza Meybodi, Kambiz Badie
AAAI
1994
14 years 7 days ago
Noise Strategies for Improving Local Search
It has recently been shown that local search is surprisingly good at nding satisfying assignments for certain computationally hard classes of CNF formulas. The performance of basi...
Bart Selman, Henry A. Kautz, Bram Cohen
IJCNN
2006
IEEE
14 years 5 months ago
Adaptation of Artificial Neural Networks Avoiding Catastrophic Forgetting
— In connectionist learning, one relevant problem is “catastrophic forgetting” that may occur when a network, trained with a large set of patterns, has to learn new input pat...
Dario Albesano, Roberto Gemello, Pietro Laface, Fr...