This paper presents a hybrid algorithm that combines local search and constraint programming techniques to solve a network routing problem. The problem considered is that of routi...
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
This paper presents a novel approach for estimating the flow fields of dynamic temporal textures whose motion differs radically from that of rigid bodies. Our approach is based o...
David Edwards, Johnny T. Chang, Lin Shi, Yizhou Yu
Queueing models are routinely used to analyze the performance of software systems. However, contrary to common assumptions, the time that a software server takes to complete jobs ...
There is increasing interest within the research community in the design and use of recursive probability models. There remains concern about computational complexity costs and th...