Because many real-world problems can be represented and solved as constraint satisfaction problems, the development of effective, efficient constraint solvers is important. A solv...
Given a graph G = (V, E), a (d, k)-coloring is a function from the vertices V to colors {1, 2, . . . , k} such that any two vertices within distance d of each other are assigned di...
This paper extends some duality results from a standard optimization setup to a noncooperative (Nash) game framework. A Nash game (NG) with coupled constraints is considered. Solv...
In this paper a new approach for classification is presented, the "Fast Projection Plane Classfier", abbreviated here to FPPC. The main idea of FPPC is very simple: A cl...
We examine how computer system problems can be derived from real application problems, with a particular focus on the relevance of some assumptions, especially those related to co...