219 search results - page 33 / 44 » Maximum common subgraph: some upper bound and lower bound re... |
144
click to vote
CLUSTER
2005
IEEE
16 years 10 days 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...
208
click to vote
CONCUR
1997
Springer
15 years 11 months 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...
161
click to vote
WDAG
2000
Springer
15 years 10 months 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...
148
Voted
TIT
2010
15 years 1 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...
212
click to vote
TELSYS
2002
2002
Performance Analysis of Reassembly and Multiplexing Queueing with Long-Range-Dependent Input Traffic
15 years 6 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...