160 search results - page 27 / 32 » Strongly Polynomial Algorithms for the Unsplittable Flow Pro... |
ESA
2007
Springer
14 years 1 months ago
2007
Springer
We consider a revenue maximization problem where we are selling a set of comparable items, each available in a certain quantity (possibly unlimited) to a set of bidders. Each bidde...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
SIGMOD
2009
ACM
14 years 8 months ago
2009
ACM
views abstract groups of tasks in a workflow into high level composite tasks, in order to reuse sub-workflows and facilitate provenance analysis. However, unless a view is careful...
SIGSOFT
2004
ACM
14 years 8 months ago
2004
ACM
In this paper, we describe PSE (Postmortem Symbolic Evaluation), a static analysis algorithm that can be used by programmers to diagnose software failures. The algorithm requires ...
AOSD
2008
ACM
13 years 9 months ago
2008
ACM
Aspect-oriented software presents new challenges for the designers of static analyses. Our work aims to establish systematic foundations for dataflow analysis of AspectJ software....