4797 search results - page 54 / 960 » The complexity of partition tasks |
EGH
2005
Springer
14 years 2 months ago
2005
Springer
Complex shaders must be partitioned into multiple passes to execute on GPUs with limited hardware resources. Automatic partitioning gives rise to an NP-hard scheduling problem tha...
COMPGEOM
2008
ACM
13 years 10 months ago
2008
ACM
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
IWPT
2001
13 years 10 months ago
2001
Natural language processing technologies offer ease-of-use of computers for average users, and easeof-access to on-line information. Natural language, however, is complex, and the...
AAAI
1994
13 years 10 months ago
1994
Most practical work on AI planningsystems during the last fteen years has been based on hierarchical task network (HTN) decomposition, but until now, there has been very little an...
RTSS
2000
IEEE
14 years 1 months ago
2000
IEEE
In this paper, we study the problem of scheduling task sets with (m,k) constraints. In our approach, jobs of each task are partitioned into two sets: mandatory and optional. Manda...