2636 search results - page 277 / 528 » Linear Programming |
119
click to vote
STOC
1991
ACM
15 years 6 months ago
1991
ACM
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
140
click to vote
HASKELL
2008
ACM
15 years 4 months ago
2008
ACM
We present Haskell libraries that statically ensure the safe use of resources such as file handles. We statically prevent accessing an already closed handle or forgetting to clos...
119
click to vote
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
261
click to vote
CP
2009
Springer
16 years 3 months ago
2009
Springer
Decision tree induction techniques attempt to find small trees that fit a training set of data. This preference for smaller trees, which provides a learning bias, is often justifie...
107
click to vote
ESOP
2007
Springer
15 years 9 months ago
2007
Springer
We give a new practical algorithm to compute, in finite time, a fixpoint (and often the least fixpoint) of a system of equations in the abstract numerical domains of zones and t...