Sciweavers

2095 search results - page 278 / 419
» Improved pebbling bounds
Sort
View
JSSPP
2004
Springer
16 years 3 days ago
LOMARC - Lookahead Matchmaking for Multi-resource Coscheduling
Job scheduling typically focuses on the CPU with little work existing to include I/O or memory. Time-shared execution provides the chance to hide I/O and long-communication latenc...
Angela C. Sodan, Lei Lan
ADC
2003
Springer
128views Database» more  ADC 2003»
15 years 12 months ago
An algorithm for the induction of defeasible logic theories from databases
Defeasible logic is a non-monotonic logic with applications in rule-based domains such as law. To ease the development and improve the accuracy of expert systems based on defeasib...
Benjamin Johnston, Guido Governatori
HPCC
2009
Springer
15 years 11 months ago
Evaluation of Coordinated Grid Scheduling Strategies
—Grid computing has emerged as a way to share geographically and organizationally distributed resources that may belong to different institutions or administrative domains. In th...
Ivan Rodero, Francesc Guim, Julita Corbalán
ASIACRYPT
2000
Springer
15 years 11 months ago
A New Forward-Secure Digital Signature Scheme
nded abstract of this work appears Advances in Cryptology — Asiacrypt 2000, Tatsuaki Okamoto, editor, Lecture Notes in Computer Science vol. 1976, Springer-Verlag, 2000. c IACR A...
Michel Abdalla, Leonid Reyzin
GIS
1998
ACM
15 years 11 months ago
Greedy Cuts: An Advancing Front Terrain Triangulation Algorithm
We apply an advancing front technique to the problem of simplification of dense digitized terrain models. While most simplification algorithms have been based on either incrementa...
Cláudio T. Silva, Joseph S. B. Mitchell