Sciweavers

61 search results - page 9 / 13
» Expressiveness Revisited
Sort
View
ICALP
2009
Springer
15 years 10 months ago
The Number of Symbol Comparisons in QuickSort and QuickSelect
Abstract We revisit the classical QuickSort and QuickSelect algorithms, under a complexity model that fully takes into account the elementary comparisons between symbols composing ...
Brigitte Vallée, James Allen Fill, Julien C...
TAMC
2010
Springer
15 years 2 months ago
A Note on the Testability of Ramsey's Class
Abstract. In property testing, the goal is to distinguish between objects that satisfy some desirable property and objects that are far from satisfying it, after examining only a s...
Charles Jordan, Thomas Zeugmann
95
Voted
APLAS
2007
ACM
15 years 1 months ago
Complete Lattices and Up-To Techniques
Abstract. We propose a theory of up-to techniques for proofs by coinduction, in the setting of complete lattices. This theory improves over existing results by providing a way to c...
Damien Pous
ESAW
2006
Springer
15 years 1 months ago
A Definition of Exceptions in Agent-Oriented Computing
The research on exception handling in Multi-Agent Systems has produced some advanced models to deal with `exceptional situations'. The expression `agent exception' is how...
Eric Platon, Nicolas Sabouret, Shinichi Honiden
CCGRID
2008
IEEE
14 years 11 months ago
Scheduling Dynamic Workflows onto Clusters of Clusters using Postponing
In this article, we revisit the problem of scheduling dynamically generated directed acyclic graphs (DAGs) of multi-processor tasks (M-tasks). A DAG is a basic model for expressin...
Sascha Hunold, Thomas Rauber, Frédér...