4565 search results - page 433 / 913 » Time Optimal Self-Stabilizing Algorithms |
151
click to vote
ESA
2009
Springer
15 years 11 months ago
2009
Springer
A hash function h, i.e., a function from the set U of all keys to the range range [m] = {0, . . . , m − 1} is called a perfect hash function (PHF) for a subset S ⊆ U of size n ...
129
click to vote
DMSN
2008
ACM
15 years 6 months ago
2008
ACM
When dealing with sensors with different time resolutions, it is desirable to model a sensor reading as pertaining to a time interval rather than a unit of time. We introduce two ...
184
click to vote
WABI
2010
Springer
15 years 3 months ago
2010
Springer
The double cut and join (DCJ) operation, introduced by Yancopoulos, Attie and Friedberg in 2005, allows one to represent most rearrangement events in genomes. However, a DCJ cannot...
237
click to vote
AAAI
2010
15 years 6 months ago
2010
The problem of dividing a sequence of values into segments occurs in database systems, information retrieval, and knowledge management. The challenge is to select a finite number ...
133
Voted
ECCC
2000
15 years 4 months ago
2000
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...