8540 search results - page 277 / 1708 » The Dynamic Servers Problem |
118
Voted
PDCN
2004
15 years 5 months ago
2004
The paper describes an experimental system in which we linked together a number of computers over the Internet to form a multi-processor computer system. The arrangeme nt uses Jav...
110
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. The Boolean satisfiability problem (SAT) can be solved efficiently with variants of the DPLL algorithm. For industrial SAT problems, DPLL with conflict analysis depend...
111
click to vote
ISCAS
1994
IEEE
15 years 7 months ago
1994
IEEE
In layout design nding e ciently good solutions to the hypergraph bipartitioning problem is of great importance. This paper introduces a new algorithm, the dynamic locking algorit...
122
click to vote
SWAT
1994
Springer
15 years 7 months ago
1994
Springer
We study the complexity of the dynamic partial sum problem in the cell-probe model. We give the model access to nondeterministic queries and prove that the problem remains hard. We...
139
click to vote
CSL
2006
Springer
15 years 3 months ago
2006
Springer
Model-checking problems for PDL (propositional dynamic logic) and its extension PDL (which includes the intersection operator on programs) over various classes of infinite state sy...