1984 search results - page 110 / 397 » The colourful feasibility problem |
166
click to vote
HIS
2004
15 years 8 months ago
2004
This paper proposes the methods to solve the constraint satisfaction problems (CSPs) using Q'tron neural networks (NNs). A Q'tron NN is local-minima free if it is built ...
176
click to vote
IBERAMIA
2004
Springer
16 years 7 days ago
2004
Springer
Abstract. In constraint satisfaction, a general rule is to tackle the hardest part of a search problem first. In this paper, we introduce a parameter (τ) that measures the constr...
200
click to vote
ICRA
2003
IEEE
16 years 4 days ago
2003
IEEE
−−−− The simultaneous localization and mapping (SLAM) with detection and tracking of moving objects (DATMO) problem is not only to solve the SLAM problem in dynamic environ...
160
click to vote
ASPDAC
1999
ACM
15 years 11 months ago
1999
ACM
We present an algorithm for solving a general min-cut, twoway partitioning problem subject to timing constraints. The problem is formulated as a constrained programming problem an...
154
click to vote
AAAI
2006
15 years 8 months ago
2006
Clustering under constraints is a recent innovation in the artificial intelligence community that has yielded significant practical benefit. However, recent work has shown that fo...