4797 search results - page 8 / 960 » The complexity of partition tasks |
CSL
2001
Springer
14 years 1 days ago
2001
Springer
We show in this paper a special extended logic, partition logic based on so called partition quantifiers, is able to capture some important complexity classes NP, P and NL by its ...
VL
1993
IEEE
13 years 11 months ago
1993
IEEE
This paper presents a new programming language named SPARCL that has four major elements: it is a visual language, it is a logic programming language, it relies on sets to organiz...
KDD
2009
ACM
14 years 2 months ago
2009
ACM
The importance of event logs, as a source of information in systems and network management cannot be overemphasized. With the ever increasing size and complexity of today’s even...
CSCWD
2008
Springer
13 years 9 months ago
2008
Springer
Task partition is a critical problem of collaborative conceptual design. Aiming at the shortage that current task partition methods don't accord to innovative functional reas...
ISCA
2002
IEEE
13 years 7 months ago
2002
IEEE
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...