Sciweavers

10493 search results - page 1960 / 2099
» Dynamic Word Problems
Sort
View
JACM
2000
131views more  JACM 2000»
13 years 7 months ago
The soft heap: an approximate priority queue with optimal error rate
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
Bernard Chazelle
JCB
2000
101views more  JCB 2000»
13 years 7 months ago
Evaluation Measures of Multiple Sequence Alignments
Multiple sequence alignments (MSAs) are frequently used in the study of families of protein sequences or DNA/RNA sequences. They are a fundamental tool for the understanding of th...
Gaston H. Gonnet, Chantal Korostensky, Steven A. B...
JUCS
2000
120views more  JUCS 2000»
13 years 7 months ago
Execution and Cache Performance of the Scheduled Dataflow Architecture
: This paper presents an evaluation of our Scheduled Dataflow (SDF) Processor. Recent focus in the field of new processor architectures is mainly on VLIW (e.g. IA-64), superscalar ...
Krishna M. Kavi, Joseph Arul, Roberto Giorgi
SCP
2000
119views more  SCP 2000»
13 years 7 months ago
Automated compositional Markov chain generation for a plain-old telephone system
Obtaining performance models, like Markov chains and queueing networks, for systems of significant complexity and magnitude is a difficult task that is usually tackled using human...
Holger Hermanns, Joost-Pieter Katoen
SIAMCOMP
2000
161views more  SIAMCOMP 2000»
13 years 7 months ago
Application-Controlled Paging for a Shared Cache
We propose a provably efficient application-controlled global strategy for organizing a cache of size k shared among P application processes. Each application has access to informa...
Rakesh D. Barve, Edward F. Grove, Jeffrey Scott Vi...
« Prev « First page 1960 / 2099 Last » Next »