1197 search results - page 142 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
TOOLS
2008
IEEE
14 years 2 months ago
2008
IEEE
In this paper, we introduce MaDcAr, a model of engines for dynamic and automatic (re)assembling of component-based software. In MaDcAr, an application description consists of the d...
CVPR
2007
IEEE
14 years 10 months ago
2007
IEEE
Tracking of speckles in echocardiography enables the study of myocardium deformation, and thus can provide insights about heart structure and function. Most of the current methods...
CSCLP
2004
Springer
14 years 1 months ago
2004
Springer
We propose an improved restart strategy for randomized backtrack search, and evaluate its performance by comparing to other heuristic and stochastic search techniques for solving r...
CEC
2009
IEEE
14 years 3 months ago
2009
IEEE
— By dividing the multiobjective optimization of the decision space into several small regions, this paper proposes multi-objective optimization algorithm based on sub-regional s...
CP
2007
Springer
14 years 2 months ago
2007
Springer
In this paper we present new techniques for improving backtracking based Quantified Constraint Satisfaction Problem (QCSP) solvers. QCSP is a generalization of CSP in which variab...