1650 search results - page 204 / 330 » The HOM problem is decidable |
130
click to vote
IPPS
2005
IEEE
15 years 10 months ago
2005
IEEE
With the latest high-end computing nodes combining shared-memory multiprocessing with hardware multithreading, new scheduling policies are necessary for workloads consisting of mu...
162
click to vote
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
We establish the first polynomial-strength time-space lower bounds for problems in the lineartime hierarchy on randomized machines with two-sided error. We show that for any inte...
160
click to vote
EDCC
2010
Springer
15 years 9 months ago
2010
Springer
: While lots of consensus algorithms have been proposed for crash-prone asynchronous message-passing systems enriched with a failure detector of the class Ω (the class of eventua...
111
click to vote
WADS
2001
Springer
15 years 9 months ago
2001
Springer
We explore the following problem: given a collection of creases on a piece of paper, each assigned a folding direction of mountain or valley, is there a flat folding by a sequenc...
152
click to vote
CADE
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. While there has been a great deal of work on the development of reasoning algorithms for expressive description logics, in most cases only Tbox reasoning is considered. I...