2485 search results - page 268 / 497 » Time Bounded Frequency Computations |
COR
2011
13 years 2 months ago
2011
We consider the problem of scheduling a maximum profit selection of equal length jobs on m identical machines. Jobs arrive online over time and the goal is to determine a non-pre...
PODC
2011
ACM
12 years 11 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
The notion of distributed functional monitoring was recently introduced by Cormode, Muthukrishnan and Yi [CMY08] to initiate a formal study of the communication cost of certain fu...
WG
2007
Springer
14 years 2 months ago
2007
Springer
In the Planar +k vertex problem the task is to find at most k vertices whose deletion makes the given graph planar. The graphs for which there exists a solution form a minor close...
SPIN
2000
Springer
13 years 12 months ago
2000
Springer
In this paper, we describe our application of SPIN 1 to model an algorithm used to synchronize the clocks of modules that provide periodic real-time communication over a network. W...