566 search results - page 69 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
109
click to vote
ECLIPSE
2005
ACM
15 years 2 months ago
2005
ACM
The heterogeneity and dynamism of today’s software systems make it difficult to assess the performance, correctness, or security of a system outside the actual time and context ...
99
Voted
CNSM
2010
14 years 10 months ago
2010
1 We address the problem of resource management for a large-scale cloud environment that hosts sites. Our contribution centers around outlining a distributed middleware architectur...
109
Voted
CEC
2007
IEEE
15 years 6 months ago
2007
IEEE
— Determining the optimal topology of a graph is pertinent to many domains, as graphs can be used to model a variety of systems. Evolutionary algorithms constitute a popular opti...
95
Voted
CPAIOR
2005
Springer
15 years 6 months ago
2005
Springer
Integration of explanations into a CSP solver is a technique addressing difficult question “why my problem has no solution”. Moreover, explanations together with advanced searc...
129
Voted
ICIP
2001
IEEE
16 years 2 months ago
2001
IEEE
A common problem in most active contour methods is that the recursive searching scheme can only return a local optimal solution. Furthermore, the internal energy of the snake is n...