1137 search results - page 38 / 228 » Partial Program Admission |
111
click to vote
ICALP
2001
Springer
15 years 5 months ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
117
Voted
APLAS
2007
ACM
15 years 4 months ago
2007
ACM
We have built the first family of tagless interpretations for a higher-order typed object language in a typed metalanguage (Haskell or ML) that require no dependent types, general...
102
Voted
TPHOL
2000
IEEE
15 years 4 months ago
2000
IEEE
We modify the reflection method to enable it to deal with partial functions like division. The idea behind reflection is to program a tactic for a theorem prover not in the impleme...
102
Voted
CORR
1998
Springer
15 years 15 days ago
1998
Springer
This paper describes a partial parser that assigns syntactic structures to sequences of partof-speech tags. The program uses the maximum entropy parameter estimation method, which...
119
click to vote
IOR
2008
15 years 24 days ago
2008
The stochastic knapsack has been used as a model in wide ranging applications from dynamic resource allocation to admission control in telecommunication. In recent years, a variat...