Sciweavers

1380 search results - page 196 / 276
» scheduling 2008
Sort
View
143
Voted
ATMOS
2008
187views Optimization» more  ATMOS 2008»
15 years 5 months ago
Solving Periodic Timetable Optimisation Problems by Modulo Simplex Calculations
In the last 15 years periodic timetable problems have found much interest in the combinatorial optimization community. We will focus on the optimisation task to minimise a weighted...
Karl Nachtigall, Jens Opitz
132
Voted
ECAI
2008
Springer
15 years 5 months ago
Solving Necklace Constraint Problems
Abstract. Some constraint problems have a combinatorial structure where the constraints allow the sequence of variables to be rotated (necklaces), if not also the domain values to ...
Pierre Flener, Justin Pearson
SODA
2008
ACM
110views Algorithms» more  SODA 2008»
15 years 5 months ago
Fast asynchronous byzantine agreement and leader election with full information
We resolve two long-standing open problems in distributed computation by describing polylogarithmic protocols for Byzantine agreement and leader election in the asynchronous full ...
Bruce M. Kapron, David Kempe, Valerie King, Jared ...
131
Voted
DAC
2008
ACM
16 years 4 months ago
Multithreaded simulation for synchronous dataflow graphs
Synchronous dataflow (SDF) has been successfully used in design tools for system-level simulation of wireless communication systems. Modern wireless communication standards involv...
Chia-Jui Hsu, José Luis Pino, Shuvra S. Bha...
91
Voted
CGO
2008
IEEE
15 years 10 months ago
Latency-tolerant software pipelining in a production compiler
In this paper we investigate the benefit of scheduling non-critical loads for a higher latency during software pipelining. "Noncritical" denotes those loads that have s...
Sebastian Winkel, Rakesh Krishnaiyer, Robyn Sampso...