4066 search results - page 178 / 814 » Almost Complete Sets |
174
click to vote
COCOA
2008
Springer
15 years 8 months ago
2008
Springer
We consider the problem of minimizing the total weighted completion time on identical parallel machines when jobs have stochastic processing times and may arrive over time. We give...
164
click to vote
CCCG
2008
15 years 8 months ago
2008
We study the problem of computing Voronoi diagrams distributedly for a set of nodes of a network modeled as a Unit Disk Graph (UDG). We present an algorithm to solve this problem ...
118
click to vote
NIPS
2007
15 years 8 months ago
2007
We introduce a functional representation of time series which allows forecasts to be performed over an unspecified horizon with progressively-revealed information sets. By virtue...
172
click to vote
INTERACT
2003
15 years 7 months ago
2003
Abstract: We show the application of the data analysis tool InfoZoom to a database of Formula One racing results. The user can interactively explore different tabular visualisation...
160
click to vote
CSL
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. For a reasonable sound and complete proof calculus for firstorder logic consider the problem to decide, given a sentence of firstorder logic and a natural number n, whet...