5214 search results - page 19 / 1043 » The Online Specialization Problem |
102
click to vote
CP
2010
Springer
15 years 9 days ago
2010
Springer
Given an arbitrary constraint c on n variables with domain size d, we show how to generate a custom propagator that establishes GAC in time O(nd) by precomputing the propagation th...
120
click to vote
AMC
2008
15 years 1 months ago
2008
The construction of s-stage explicit two- and three-step peer methods of order p = 2s and p = 3s is considered for the solution of non-stiff second order initial value problems wh...
149
click to vote
SIAMCOMP
2012
13 years 4 months ago
2012
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...
102
click to vote
ECOOPW
1999
Springer
15 years 6 months ago
1999
Springer
Software components o er numerous advantages in terms of development, but may give rise to ine ciency due to highly generic implementations. Program specialization can automatical...
108
click to vote
SNPD
2004
15 years 3 months ago
2004
The problem of testing programs without test oracles is well known. A commonly used approach is to use special values in testing but this is often insufficient to ensure program c...