Sciweavers

1818 search results - page 135 / 364
» Granularity-Adaptive Proof Presentation
Sort
View
JFP
2000
163views more  JFP 2000»
13 years 10 months ago
Automatic useless-code elimination for HOT functional programs
In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and compl...
Ferruccio Damiani, Paola Giannini
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
13 years 28 days ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...
ICLP
2005
Springer
14 years 3 months ago
Modeling Systems in CLP
We present a methodology for the modeling of complex program behavior in CLP. In the first part we present an informal description about how to represent a system in CLP. At its ...
Joxan Jaffar, Andrew E. Santosa, Razvan Voicu
SACRYPT
1998
Springer
173views Cryptology» more  SACRYPT 1998»
14 years 2 months ago
A Lattice-Based Public-Key Cryptosystem
In 1998, Cai and Cusick proposed a lattice-based public-key cryptosystem based on the similar ideas of the Ajtai-Dwork cryptosystem, but with much less data expansion. However, th...
Jin-yi Cai, Thomas W. Cusick
ALDT
2009
Springer
126views Algorithms» more  ALDT 2009»
14 years 2 months ago
On Low-Envy Truthful Allocations
We study the problem of allocating a set of indivisible items to players having additive utility functions over the items. We consider allocations in which no player envies the bun...
Ioannis Caragiannis, Christos Kaklamanis, Panagiot...