Sciweavers

612 search results - page 56 / 123
» Hardness assumptions in the foundations of theoretical compu...
Sort
View
SOFSEM
2009
Springer
14 years 4 months ago
Automatic Bug Detection in Microcontroller Software by Static Program Analysis
Microcontroller software typically consists of a few hundred lines of code only, but it is rather different from standard application code. The software is highly hardware and pla...
Ansgar Fehnker, Ralf Huuck, Bastian Schlich, Micha...
FOCS
2000
IEEE
13 years 11 months ago
Approximating the single source unsplittable min-cost flow problem
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
Martin Skutella
FOCS
2008
IEEE
13 years 9 months ago
On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP
In this paper we consider the following maximum budgeted allocation (MBA) problem: Given a set of m indivisible items and n agents; each agent i willing to pay bij on item j and w...
Deeparnab Chakrabarty, Gagan Goel
STACS
2007
Springer
14 years 1 months ago
On Fixed Point Equations over Commutative Semirings
Fixed point equations x = f(x) over ω-continuous semirings can be seen as the mathematical foundation of interprocedural program analysis. The sequence 0, f(0), f2 (0), . . . conv...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
ERSHOV
1999
Springer
14 years 3 days ago
The Essence of Program Transformation by Partial Evaluation and Driving
Abstract. An abstract framework is developed to describe program transformation by specializing a given program to a restricted set of inputs. Particular cases include partial eval...
Neil D. Jones