Sciweavers

2206 search results - page 341 / 442
» On the power of coercion abstraction
Sort
View
SLP
1993
110views more  SLP 1993»
13 years 11 months ago
Logic Program Specialisation With Deletion of Useless Clauses
In this paper we describe a method of programspecialisation and give an extended example of its application to specialisation of a refutation proof procedure for rst order logic. ...
D. Andre de Waal, John P. Gallagher
CCGRID
2010
IEEE
13 years 11 months ago
Towards Energy Aware Scheduling for Precedence Constrained Parallel Tasks in a Cluster with DVFS
Abstract--Reducing energy consumption for high end computing can bring various benefits such as, reduce operating costs, increase system reliability, and environment respect. This ...
Lizhe Wang, Gregor von Laszewski, Jai Dayal, Fugan...
CCIA
2009
Springer
13 years 11 months ago
On in-vitro and in-vivo IVUS data fusion
Abstract. The design and the validation of an automatic plaque characterization technique based on Intravascular Ultrasound (IVUS) usually requires a data ground-truth. The histolo...
Francesco Ciompi, Oriol Pujol, Oriol Rodriguez-Leo...
CONCUR
2010
Springer
13 years 11 months ago
Mean-Payoff Automaton Expressions
Abstract. Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on tr...
Krishnendu Chatterjee, Laurent Doyen, Herbert Edel...
CSL
2010
Springer
13 years 11 months ago
Automata vs. Logics on Data Words
Abstract. The relationship between automata and logics has been investigated since the 1960s. In particular, it was shown how to determine, given an automaton, whether or not it is...
Michael Benedikt, Clemens Ley, Gabriele Puppis