1977 search results - page 28 / 396 » The satisfactory partition problem |
157
click to vote
DM
2010
15 years 5 months ago
2010
A general (rectangular) partition is a partition of a rectangle into an arbitrary number of non-overlapping subrectangles. This paper examines vertex colorings using four colors o...
181
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
In this paper we study the partitioning approach for multiprocessor real-time scheduling. This approach seems to be the easiest since, once the partitioning of the task set has be...
172
click to vote
CORR
2007
Springer
15 years 5 months ago
2007
Springer
The Steiner tree problem is a classical NP-hard optimization problem with a wide range of practical applications. In an instance of this problem, we are given an undirected graph ...
157
click to vote
ATAL
2007
Springer
15 years 12 months ago
2007
Springer
Canonical problems are simplified representations of a class of real world problems. They allow researchers to compare algorithms in a standard setting which captures the most im...
148
Voted
AAAI
1998
15 years 7 months ago
1998
Despite much research that has been done on constraint satisfaction problems (CSP's), the framework is sometimes inflexible and the results are not very satisfactory when app...