1480 search results - page 191 / 296 » Ants can solve constraint satisfaction problems |
180
click to vote
NIPS
2001
15 years 8 months ago
2001
In this paper we will show that a restricted class of constrained minimum divergence problems, named generalized inference problems, can be solved by approximating the KL divergen...
176
click to vote
TCS
2008
15 years 6 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
142
click to vote
AUTOMATICA
2006
15 years 6 months ago
2006
: A path-following problem for linear systems with unstable zero dynamics is solved. While the original control variable steers the system output along the path, the path parameter...
176
click to vote
ECCV
1998
Springer
16 years 8 months ago
1998
Springer
Assume that some objects are present in an image but can be seen only partially and are overlapping each other. To recognize the objects, we have to rstly separate the objects from...
217
click to vote
COCOS
2003
Springer
15 years 11 months ago
2003
Springer
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...