In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
: Multimedia applications nowadays are becoming prevalent. In the past the relational database model was generalized to the multimedia database model. More recently the relational ...
Shi-Kuo Chang, Lei Zhao, Shenoda Guirguis, Rohit K...
Web service-based workflow management systems have garnered considerable attention for automating and scheduling dependent operations. Such systems often support user preferences,...
David Chiu, Sagar Deshpande, Gagan Agrawal, Rongxi...
Genetic programming is known to provide good solutions for many problems like the evolution of network protocols and distributed algorithms. In such cases it is most likely a hard...
Thomas Weise, Michael Zapf, Mohammad Ullah Khan, K...
We propose and investigate a game-theoretic approach to the malware filtering and detector placement problem which arises in network security. Our main objective is to develop opt...
Stephan Schmidt, Tansu Alpcan, Sahin Albayrak, Tam...