7106 search results - page 239 / 1422 » Restricted Complexity, General Complexity |
127
click to vote
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
155
click to vote
BPM
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Business process (BP) modeling is a building block for design and management of business processes. Two fundamental aspects of BP modeling are: a formal framework that we...
116
click to vote
BTW
2007
Springer
15 years 10 months ago
2007
Springer
B-tree and index into two layers of abstraction. In addition, this paper provides algorithms for (i) concurrency control and recovery including locking of individual keys and of co...
124
click to vote
COCO
2007
Springer
15 years 10 months ago
2007
Springer
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....
122
click to vote
IPPS
2006
IEEE
15 years 10 months ago
2006
IEEE
Applications for constrained embedded systems are subject to strict time constraints and restrictive resource utilization. With soft core processors, application developers can cu...