Sciweavers

11949 search results - page 115 / 2390
» Some results on (a:b)-choosability
Sort
View
80
Voted
CP
2003
Springer
15 years 6 months ago
Scheduling in the Face of Uncertain Resource Consumption and Utility
We discuss the problem of scheduling tasks that consume uncertain amounts of a resource with known capacity and where the tasks have uncertain utility. In these circumstances, we w...
Jeremy Frank, Richard Dearden
FORMATS
2003
Springer
15 years 6 months ago
On Timing Analysis of Combinational Circuits
In this paper we report some progress in applying timed automata technology to large-scale problems. We focus on the problem of finding maximal stabilization time for combinationa...
Ramzi Ben Salah, Marius Bozga, Oded Maler
FUN
2010
Springer
251views Algorithms» more  FUN 2010»
15 years 6 months ago
UNO Is Hard, Even for a Single Player
UNOR is one of the world-wide well-known and popular card games. We investigate UNO from the viewpoint of combinatorial algorithmic game theory by giving some simple and concise ma...
Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara,...
SCALESPACE
2001
Springer
15 years 5 months ago
Total Variation Based Oversampling of Noisy Images
Abstract. We propose a variational model which permits to simultaneously deblur and oversample an image. Indeed, after some recalls on an existing variational model for image overs...
François Malgouyres
SOFSEM
2001
Springer
15 years 5 months ago
Pipelined Decomposable BSP Computers
The class of weak parallel machines is interesting, because it contains some realistic parallel machine models, especially suitable for pipelined computations. We prove that a modi...
Martin Beran