Sciweavers

142 search results - page 24 / 29
» A Small Framework for Proof Checking
Sort
View
OTM
2007
Springer
15 years 3 months ago
Volunteer Computing, an Interesting Option for Grid Computing: Extremadura as Case Study
This paper presents the works done by several research groups from University of Extremadura and CETA-CIEMAT (Centro Extreme˜no de Tecnolog´ıas Avanzadas) in order to deploy an ...
Miguel Cárdenas Montes, Miguel A. Vega-Rodr...
ICALP
2010
Springer
15 years 2 months ago
Automata for Coalgebras: An Approach Using Predicate Liftings
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...
Gaëlle Fontaine, Raul Andres Leal, Yde Venema
EVOW
2006
Springer
15 years 1 months ago
Divide-and-Evolve: A New Memetic Scheme for Domain-Independent Temporal Planning
An original approach, termed Divide-and-Evolve is proposed to hybridize Evolutionary Algorithms (EAs) with Operational Research (OR) methods in the domain of Temporal Planning Prob...
Marc Schoenauer, Pierre Savéant, Vincent Vi...
JOC
2011
104views more  JOC 2011»
14 years 9 days ago
Short Undeniable Signatures Based on Group Homomorphisms
This paper is devoted to the design and analysis of short undeniable signatures based on a random oracle. Exploiting their online property, we can achieve signatures with a fully s...
Jean Monnerat, Serge Vaudenay
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
15 years 4 months ago
Locally Testable Codes Require Redundant Testers
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman...