Cooperative distributed problem solving (CDPS) loosely-coupledagentscan be effectively modeledas a distributed constraint satisfaction problem(DCSP) whereeach agent has multiple l...
Abstract. Ariola and Felleisen's call-by-need -calculus replaces a variable occurrence with its value at the last possible moment. To support this gradual notion of substituti...
Memetic algorithms with continuous local search methods have arisen as effective tools to address the difficulty of obtaining reliable solutions of high precision for complex cont...
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...
With the advent of new video standards such as MPEG-4 part-10 and H.264/H.26L, demands for advanced video coding (AVC), particularly in area of variable block searching motion est...