Sciweavers

1560 search results - page 74 / 312
» Order Functions and Evaluation Codes
Sort
View
GECCO
2006
Springer
161views Optimization» more  GECCO 2006»
14 years 1 months ago
The LEM3 implementation of learnable evolution model and its testing on complex function optimization problems
1 Learnable Evolution Model (LEM) is a form of non-Darwinian evolutionary computation that employs machine learning to guide evolutionary processes. Its main novelty are new type o...
Janusz Wojtusiak, Ryszard S. Michalski
CCE
2007
13 years 10 months ago
Adaptive optimisation of noisy black-box functions inherent in microscopic models
For systems where exact constitutive relations are unknown, a microscopic level description can be alternatively used. As microscopic simulations are computationally expensive, th...
Eddie Davis, Marianthi G. Ierapetritou
COMPSEC
2010
142views more  COMPSEC 2010»
13 years 6 months ago
Provably correct Java implementations of Spi Calculus security protocols specifications
Spi Calculus is an untyped high level modeling language for security protocols, used for formal protocols specification and verification. In this paper, a type system for the Spi ...
Alfredo Pironti, Riccardo Sisto
IDEAS
2000
IEEE
96views Database» more  IDEAS 2000»
14 years 2 months ago
A Cost Function for Uniformly Partitioned UB-Trees
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
Volker Markl, Rudolf Bayer
IH
2009
Springer
14 years 4 months ago
Estimating the Minimal Length of Tardos Code
Abstract. This paper estimates the minimal length of a binary probabilistic traitor tracing code. We consider the code construction proposed by G. Tardos in 2003, with the symmetri...
Teddy Furon, Luis Pérez-Freire, Arnaud Guya...