589 search results - page 14 / 118 » Introducing Dynamic Constraints in B |
GECCO
2000
Springer
13 years 11 months ago
2000
Springer
A hybrid method of evolutionary algorithms is introduced in this study. The hybrid method includes two additional operations, acceleration and migrating operations. These two oper...
CDC
2009
IEEE
14 years 20 days ago
2009
IEEE
Abstract— We study the problem of maximizing the aggregated revenue in sensor networks with deadline constraints. Our model is that of a sensor network that is arranged in the fo...
ISLPED
2009
ACM
14 years 2 months ago
2009
ACM
Increasing power densities and the high cost of low thermal resistance packages and cooling solutions make it impractical to design processors for worst-case temperature scenarios...
SDM
2004
SIAM
13 years 9 months ago
2004
SIAM
It has long been known that Dynamic Time Warping (DTW) is superior to Euclidean distance for classification and clustering of time series. However, until lately, most research has...
CPAIOR
2004
Springer
14 years 1 months ago
2004
Springer
To improve solution robustness, we introduce the concept of super solutions to constraint programming. An (a, b)-super solution is one in which if a variables lose their values, th...