Sciweavers

3319 search results - page 168 / 664
» Type Theoretical Databases
Sort
View
TKDE
2002
166views more  TKDE 2002»
14 years 9 months ago
A Comprehensive Analytical Performance Model for Disk Devices under Random Workloads
Our goal with this paper is to contribute a common theoretical framework for studying the performance of disk-storage devices. Understanding the performance behavior of these devi...
Peter Triantafillou, Stavros Christodoulakis, Cost...
75
Voted
STACS
2009
Springer
15 years 5 months ago
Semi-Online Preemptive Scheduling: One Algorithm for All Variants
We present a unified optimal semi-online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize the makespan. This algorithm works for a...
Tomás Ebenlendr, Jiri Sgall
114
Voted
ARGMAS
2009
Springer
15 years 4 months ago
Realizing Argumentation in Multi-agent Systems Using Defeasible Logic Programming
We describe a working multi-agent architecture based on Defeasible Logic Programming (DeLP) by Garc´ıa and Simari where agents are engaged in an argumentation to reach a common c...
Matthias Thimm
68
Voted
RTA
2009
Springer
15 years 4 months ago
The Existential Fragment of the One-Step Parallel Rewriting Theory
It is known that the first-order theory with a single predicate → that denotes one-step rewriting reduction on terms is undecidable already for formulae with ∃∀ prefix. Sev...
Aleksy Schubert
RTA
2007
Springer
15 years 4 months ago
A Simple Proof That Super-Consistency Implies Cut Elimination
Abstract. We give a simple and direct proof that super-consistency implies cut elimination in deduction modulo. This proof can be seen as a simplification of the proof that super-...
Gilles Dowek, Olivier Hermant