Sciweavers

207 search results - page 14 / 42
» Run-Time Switching Between Total Order Algorithms
Sort
View
TCS
2008
13 years 7 months ago
Algorithms for computing variants of the longest common subsequence problem
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
Costas S. Iliopoulos, M. Sohel Rahman
SCA
2007
13 years 9 months ago
A simple boiling module
Recent efforts to visually capture the phenomena of boiling have proposed monolithic approaches that extend the basic techniques underlying existing fluid solvers. In this work, w...
Theodore Kim, Mark Carlson
COCOON
2005
Springer
14 years 28 days ago
On the Complexity of the Balanced Vertex Ordering Problem
We consider the problem of finding a balanced ordering of the vertices of a graph. More precisely, we want to minimise the sum, taken over all vertices v, of the difference betwe...
Jan Kára, Jan Kratochvíl, David R. W...
WSC
1998
13 years 8 months ago
A Study of Self-adjusting Quality of Service Control Schemes
This paper reports simulation methods and results for analyzing a self-adjusting Quality of Service (QoS) control scheme for multimedia/telecommunication systems based on resource...
Sheng-Tzong Cheng, Chi-Ming Chen, Ing-Ray Chen
TON
2010
107views more  TON 2010»
13 years 2 months ago
Rate Quantization and the Speedup Required to Achieve 100% Throughput for Multicast Over Crossbar Switches
Abstract-- The problem of providing quality of service guarantees for multicast traffic over crossbar switches has received a limited attention, despite the popularity of its count...
Can Emre Koksal