1650 search results - page 128 / 330 » The HOM problem is decidable |
128
click to vote
COMPSAC
1999
IEEE
15 years 8 months ago
1999
IEEE
In this paper, we study the optimal software release problem considering cost, reliability and testing eficiency. We first propose a generalized logistic testing-effort function t...
118
click to vote
CAV
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. In order to make multithreaded programming manageable, programmers often follow a design principle where they break the problem into tasks which are then solved asynchron...
130
click to vote
ICALP
1995
Springer
15 years 7 months ago
1995
Springer
We describe the rst parallel algorithm with optimal speedup for constructing minimum-width tree decompositions of graphs of bounded treewidth. On n-vertex input graphs, the algori...
117
click to vote
FLAIRS
2007
15 years 6 months ago
2007
Temporal Networks play an important role in solving planning problems and they are also used, though not as frequently, when solving scheduling problems. In this paper we propose ...
158
click to vote
COCO
2008
Springer
15 years 6 months ago
2008
Springer
We study the complexity of deciding whether a given homogeneous multivariate polynomial has a nontrivial root over a finite field. Given a homogeneous algebraic circuit C that com...