314 search results - page 28 / 63 » Complete Problems for Dynamic Complexity Classes |
119
click to vote
INFOCOM
2005
IEEE
15 years 8 months ago
2005
IEEE
— We consider a network of rechargeable sensors, deployed redundantly in a random sensing environment, and address the problem of how sensor nodes should be activated dynamically...
104
click to vote
JCT
2011
14 years 9 months ago
2011
We investigate finite 3-nets embedded in a projective plane over a (finite or infinite) field of any characteristic p. Such an embedding is regular when each of the three clas...
135
click to vote
ECOOP
1999
Springer
15 years 6 months ago
1999
Springer
We discuss aspects of inlining of virtual method invocations. First, we introduce a new method test to guard inlinings of such invocations, with a di erent set of tradeo s from the...
111
Voted
TASE
2008
IEEE
15 years 8 months ago
2008
IEEE
We present a thorough study of Propositional Dynamic Logic over a variation of labeled transition systems, called accelerated labelled transition systems, which are transition sys...
124
click to vote
IOR
2007
15 years 2 months ago
2007
We consider the problem of maximizing capacity in a queueing network with flexible servers, where the classes and servers are subject to failure. We assume that the interarrival ...