Sciweavers

5084 search results - page 391 / 1017
» Proving Possibility Properties
Sort
View
AMAST
2008
Springer
15 years 8 months ago
Towards an Efficient Implementation of Tree Automata Completion
Term Rewriting Systems (TRSs) are now commonly used as a modeling language for applications. In those rewriting based models, reachability analysis, i.e. proving or disproving that...
Emilie Balland, Yohan Boichut, Thomas Genet, Pierr...
APPROX
2008
Springer
127views Algorithms» more  APPROX 2008»
15 years 8 months ago
Approximating Single Machine Scheduling with Scenarios
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svenss...
274
Voted
ECAIW
2008
Springer
15 years 8 months ago
An Autonomous Algorithm for Generating and Merging Clinical Algorithms
Abstract. Procedural knowledge in medicine uses to come expressed as isolated sentences in Clinical Practice Guidelines (CPG) that describe how to act in front of specific health-c...
Francis Real, David Riaño
CORR
2010
Springer
102views Education» more  CORR 2010»
15 years 7 months ago
Structure of random r-SAT below the pure literal threshold
It is well known that there is a sharp density threshold for a random r-SAT formula to be satisfiable, and a similar, smaller, threshold for it to be satisfied by the pure literal ...
Alexander D. Scott, Gregory B. Sorkin
APAL
2006
73views more  APAL 2006»
15 years 6 months ago
On the parallel between the suplattice and preframe approaches to locale theory
This paper uses the locale theory approach to topology. Two descriptions are given of all locale limits, the first description using suplattice constructions and the second prefra...
Christopher F. Townsend