Sciweavers

2905 search results - page 314 / 581
» Formal Memetic Algorithms
Sort
View
109
Voted
FMCAD
2007
Springer
15 years 9 months ago
Lifting Propositional Interpolants to the Word-Level
— Craig interpolants are often used to approximate inductive invariants of transition systems. Arithmetic relationships between numeric variables require word-level interpolants,...
Daniel Kroening, Georg Weissenbacher
130
Voted
FORMATS
2007
Springer
15 years 9 months ago
Quantitative Model Checking Revisited: Neither Decidable Nor Approximable
Abstract. Quantitative model checking computes the probability values of a given property quantifying over all possible schedulers. It turns out that maximum and minimum probabilit...
Sergio Giro, Pedro R. D'Argenio
128
Voted
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
15 years 9 months ago
Geometric particle swarm optimisation on binary and real spaces: from theory to practice
Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both continu...
Cecilia Di Chio, Alberto Moraglio, Riccardo Poli
139
Voted
ICDT
2007
ACM
133views Database» more  ICDT 2007»
15 years 9 months ago
XML Schema Mappings in the Presence of Key Constraints and Value Dependencies
Abstract. Schema mappings play a central role in both data integration and data exchange, and are understood as high-level specifications describing the relationships between data...
Tadeusz Pankowski, Jolanta Cybulka, Adam Meissner
IFIP
2007
Springer
15 years 9 months ago
A Reputation-Based Approach for Securing Vivaldi Embedding System
Many large-scale Internet applications optimize their overlay network to reduce latencies. Embedding coordinate systems like Vivaldi are valuable tools for this new range of applic...
Damien Saucez, Benoit Donnet, Olivier Bonaventure