We solve the Flexible Job-Shop Problem (FJSP) by using dispatching rules discovered through Genetic Programming (GP). While Simple Priority Rules (SPR) have been widely applied in ...
This paper proposes a general solution model using agent technology in order to solve two critical open issues in the course timetabling problem: application-specific issues and d...
—As we all know, Hanoi Problem is a classical case of recursive algorithm in programming. In this paper, we study the problem in another way by numbering the peg from bottom to t...
Semantic Web Services are a promising combination of Semantic Web and Web service technology, aiming at providing means of automatically executing, discovering and composing seman...
Mario T. Schlosser, Michael Sintek, Stefan Decker,...
Abstract. Multimedia style sheet systems uniformly use a constraintbased model of layout. Constraints provide a uniform mechanism for all aspects of style management and layout and...