Sciweavers

2905 search results - page 149 / 581
» Formal Memetic Algorithms
Sort
View
ASIAN
2003
Springer
126views Algorithms» more  ASIAN 2003»
14 years 1 months ago
Information Flow Security for XML Transformations
Abstract. We provide a formal definition of information flows in XML transformations and, more generally, in the presence of type driven computations and describe a sound technique...
Véronique Benzaken, Marwan Burelle, Giusepp...
COLT
2008
Springer
14 years 2 days ago
Learning from Collective Behavior
Inspired by longstanding lines of research in sociology and related fields, and by more recent largepopulation human subject experiments on the Internet and the Web, we initiate a...
Michael Kearns, Jennifer Wortman
ACL
2008
13 years 11 months ago
A Deductive Approach to Dependency Parsing
We define a new formalism, based on Sikkel's parsing schemata for constituency parsers, that can be used to describe, analyze and compare dependency parsing algorithms. This ...
Carlos Gómez-Rodríguez, John A. Carr...
FASE
2004
Springer
14 years 2 months ago
Specification and Analysis of Real-Time Systems Using Real-Time Maude
Real-Time Maude is a language and tool supporting the formal specification and analysis of real-time and hybrid systems. The specification formalism is based on rewriting logic, em...
Peter Csaba Ölveczky, José Meseguer
FORMATS
2005
Springer
14 years 3 months ago
Diagonal Constraints in Timed Automata: Forward Analysis of Timed Systems
Timed automata (TA) are a widely used model for real-time systems. Several tools are dedicated to this model, and they mostly implement a forward analysis for checking reachability...
Patricia Bouyer, François Laroussinie, Pier...