Sciweavers

7519 search results - page 339 / 1504
» Optimizing Generic Functions
Sort
View
ECCC
2010
82views more  ECCC 2010»
15 years 6 months ago
On optimal proof systems and logics for PTIME
We prove that TAUT has a p-optimal proof system if and only if a logic related to least fixed-point logic captures polynomial time on all finite structures. Furthermore, we show t...
Yijia Chen, Jörg Flum
MST
2008
157views more  MST 2008»
15 years 6 months ago
Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation
We study the problem of on-line scheduling on two uniformly related machines where the on-line algorithm has resources different from those of the off-line algorithm. We consider ...
Leah Epstein, Arik Ganot
CORR
2002
Springer
96views Education» more  CORR 2002»
15 years 6 months ago
The Sketch of a Polymorphic Symphony
In previous work, we have introduced functional strategies, that is, first-class generic functions that can traverse into terms of any type while mixing uniform and type-specific ...
Ralf Lämmel
STOC
2012
ACM
236views Algorithms» more  STOC 2012»
13 years 9 months ago
On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
We propose a new notion of secure multiparty computation aided by a computationally-powerful but untrusted “cloud” server. In this notion that we call on-the-fly multiparty c...
Adriana López-Alt, Eran Tromer, Vinod Vaiku...
ICML
2005
IEEE
16 years 7 months ago
Finite time bounds for sampling based fitted value iteration
In this paper we consider sampling based fitted value iteration for discounted, large (possibly infinite) state space, finite action Markovian Decision Problems where only a gener...
Csaba Szepesvári, Rémi Munos