Sciweavers

777 search results - page 56 / 156
» A fast algorithm for the computation of an upper bound on th...
Sort
View
APPROX
2009
Springer
137views Algorithms» more  APPROX 2009»
14 years 2 months ago
Testing Computability by Width Two OBDDs
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
Dana Ron, Gilad Tsur
ICPR
2008
IEEE
14 years 2 months ago
Constrained piecewise linear approximation of digital curves
We have considered a problem of continuous piecewise linear approximation of the digital curves with a minimum number of the line segments. Fast suboptimal algorithm for constrain...
Alexander Kolesnikov
TC
2002
13 years 7 months ago
Fast Asynchronous Uniform Consensus in Real-Time Distributed Systems
We investigate whether asynchronous computational models and asynchronous algorithms can be considered for designing real-time distributed fault-tolerant systems. A priori, the lac...
Jean-François Hermant, Gérard Le Lan...
STACS
2005
Springer
14 years 1 months ago
Improved Algorithms for Dynamic Page Migration
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
Marcin Bienkowski, Miroslaw Dynia, Miroslaw Korzen...
ICCS
2005
Springer
14 years 1 months ago
Improved Tag Set Design and Multiplexing Algorithms for Universal Arrays
In this paper we address two optimization problems arising in the design of genomic assays based on universal tag arrays. First, we address the universal array tag set design probl...
Ion I. Mandoiu, Claudia Prajescu, Dragos Trinca