Sciweavers

1137 search results - page 38 / 228
» Partial Program Admission
Sort
View
ICALP
2001
Springer
15 years 2 months ago
Approximation Algorithms for Partial Covering Problems
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...
Rajiv Gandhi, Samir Khuller, Aravind Srinivasan
87
Voted
APLAS
2007
ACM
15 years 1 months ago
Finally Tagless, Partially Evaluated
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...
Jacques Carette, Oleg Kiselyov, Chung-chieh Shan
TPHOL
2000
IEEE
15 years 1 months ago
Equational Reasoning via Partial Reflection
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...
Herman Geuvers, Freek Wiedijk, Jan Zwanenburg
CORR
1998
Springer
109views Education» more  CORR 1998»
14 years 9 months ago
A Maximum-Entropy Partial Parser for Unrestricted Text
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...
Wojciech Skut, Thorsten Brants
IOR
2008
105views more  IOR 2008»
14 years 9 months ago
The Stochastic Knapsack Revisited: Switch-Over Policies and Dynamic Pricing
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...
Grace Y. Lin, Yingdong Lu, David D. Yao