219 search results - page 33 / 44 » Maximum common subgraph: some upper bound and lower bound re... |
CLUSTER
2005
IEEE
14 years 2 months ago
2005
IEEE
To balance performance goals and allow administrators to declaratively specify high-level performance goals, we apply complete search algorithms to design on-line job scheduling p...
CONCUR
1997
Springer
14 years 22 days ago
1997
Springer
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets of con gurations of such systems by means of nite-state automata. In order to re...
WDAG
2000
Springer
14 years 4 days ago
2000
Springer
This paper presents a study of a distributed cooperation problem under the assumption that processors may not be able to communicate for a prolonged time. The problem for n proces...
TIT
2010
13 years 3 months ago
2010
We study error-correcting codes for permutations under the infinity norm, motivated the rank-modulation scheme for flash memories. In this scheme, a set of n flash cells are combin...
TELSYS
2002
2002
Performance Analysis of Reassembly and Multiplexing Queueing with Long-Range-Dependent Input Traffic
13 years 8 months ago
This paper studies the impact of long-range-dependent (LRD) traffic on the performance of reassembly and multiplexing queueing. A queueing model characterizing the general reassemb...