1480 search results - page 182 / 296 » Ants can solve constraint satisfaction problems |
156
click to vote
ECCV
2010
Springer
15 years 11 months ago
2010
Springer
This paper presents a unified approach to solve different bilinear factorization problems in Computer Vision in the presence of missing data in the measurements. The problem is f...
162
click to vote
ISCAS
1994
IEEE
15 years 10 months ago
1994
IEEE
Earlier research has shown that the problem of optimal weighted median filtering with structural constraints can be formulated as a nonconvex nonlinear programming problem in gene...
157
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
When the transition probabilities and rewards of a Markov Decision Process are specified exactly, the problem can be solved without any interaction with the environment. When no s...
195
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
This paper presents an approach to build Sparse Large Margin Classifiers (SLMC) by adding one more constraint to the standard Support Vector Machine (SVM) training problem. The ad...
153
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-Dimensional Matching problem asks wheth...