Sciweavers

989 search results - page 114 / 198
» Pebbling and Proofs of Work
Sort
View
SAS
2004
Springer
123views Formal Methods» more  SAS 2004»
14 years 1 months ago
Non-termination Inference for Constraint Logic Programs
Termination has been a subject of intensive research in the logic programming community for the last two decades. Most works deal with proving universal left termination of a given...
Étienne Payet, Frédéric Mesna...
VL
2003
IEEE
126views Visual Languages» more  VL 2003»
14 years 1 months ago
Generalizing WYSIWYT visual testing to screen transition languages
ct How can rigorous forms of testing be supported in a way that is both compatible with the visual aspect of visual programming languages, and usable by the audiences using those l...
Darren Brown, Margaret M. Burnett, Gregg Rothermel...
IUI
2003
ACM
14 years 1 months ago
An experiment in automated humorous output production
Computational humor will be needed in interfaces, no less than other cognitive capabilities. There are many practical settings where computational humor will add value. Among them...
Oliviero Stock, Carlo Strapparava
KBSE
2000
IEEE
14 years 14 days ago
Model Checking Programs
The majority of work carried out in the formal methods community throughout the last three decades has (for good reasons) been devoted to special languages designed to make it eas...
Willem Visser, Klaus Havelund, Guillaume P. Brat, ...
MLDM
1999
Springer
14 years 10 days ago
Automatic Design of Multiple Classifier Systems by Unsupervised Learning
In the field of pattern recognition, multiple classifier systems based on the combination of the outputs of a set of different classifiers have been proposed as a method for the de...
Giorgio Giacinto, Fabio Roli