248 search results - page 34 / 50 » The Multi-Story Space Assignment Problem |
102
click to vote
AAAI
2008
15 years 3 months ago
2008
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...
108
Voted
HYBRID
1995
Springer
15 years 4 months ago
1995
Springer
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...
146
click to vote
ICMLA
2004
15 years 2 months ago
2004
: 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...
78
Voted
AAAI
1994
15 years 1 months ago
1994
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...
106
click to vote
IJCNN
2006
IEEE
15 years 6 months ago
2006
IEEE
— 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...