5214 search results - page 43 / 1043 » The Online Specialization Problem |
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We propose a special computational device which uses light rays for solving the subset-sum problem. The device has a graph-like representation and the light is traversing it by fol...
ICALT
2005
IEEE
14 years 1 months ago
2005
IEEE
This paper reports MALESAbrain an intelligent online tool for problem-based learning (PBL) in IT education. The learning model of MALESAbrain is built on the notions of threshold ...
CRV
2009
IEEE
14 years 2 months ago
2009
IEEE
The problem of online sampling of data, can be seen as a generalization of the classical secretary problem. The goal is to maximize the probability of picking the k highest scorin...
LOPSTR
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We introduce a just-in-time specializer for Prolog. Just-intime specialization attempts to unify of the concepts and benefits of partial evaluation (PE) and just-in-time...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...