1197 search results - page 73 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
CP
1995
Springer
14 years 27 days ago
1995
Springer
Abstract. We investigate the dynamic variable ordering (DVO) technique commonly used in conjunction with tree-search algorithms for solving constraint satisfaction problems. We fi...
KDD
2004
ACM
14 years 9 months ago
2004
ACM
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemsetbase...
ISVC
2010
Springer
13 years 7 months ago
2010
Springer
Dealing with multi-object tracking in a particle filter raises several issues. A first essential point is to model possible interactions between objects. In this article, we repr...
ASPDAC
2009
ACM
14 years 3 months ago
2009
ACM
— 1In this paper, we will present a placement method for analog circuits. We consider both common centroid and 1-D symmetry constraints, which are the two most common types of pl...
OL
2007
13 years 8 months ago
2007
We propose an SQP-type algorithm for solving nonlinear second-order cone programming (NSOCP) problems. At every iteration, the algorithm solves a convex SOCP subproblem in which th...