Sciweavers

1003 search results - page 16 / 201
» Extending the Adaptability of Reference Models
Sort
View
100
Voted
ANTSW
2006
Springer
15 years 5 months ago
Extending the Particle Swarm Algorithm to Model Animal Foraging Behaviour
The particle swarm algorithm contains elements which map fairly strongly to the foraging problem in behavioural ecology. In this paper, we show how some simple adaptions to the sta...
Cecilia Di Chio, Riccardo Poli, Paolo Di Chio
COOPIS
2004
IEEE
15 years 5 months ago
Composing Mappings Between Schemas Using a Reference Ontology
Large-scale database integration requires a significant cost in developing a global schema and finding mappings between the global and local schemas. Developing the global schema r...
Eduard C. Dragut, Ramon Lawrence
109
Voted
LATA
2010
Springer
15 years 7 months ago
Extending Stochastic Context-Free Grammars for an Application in Bioinformatics
We extend stochastic context-free grammars such that the probability of applying a production can depend on the length of the subword that is generated from the application and sho...
Frank Weinberg, Markus E. Nebel
SGAI
2007
Springer
15 years 7 months ago
Extending Jess to Handle Uncertainty
Computer scientists are often faced with the challenge of having to model the world and its associated uncertainties. One area in particular where modelling uncertainty is importa...
David Corsar, Derek H. Sleeman, Anne McKenzie
ESORICS
2009
Springer
16 years 1 months ago
Formal Indistinguishability Extended to the Random Oracle Model
Abstract. Several generic constructions for transforming one-way functions to asymmetric encryption schemes have been proposed. One-way functions only guarantee the weak secrecy of...
Cristian Ene, Yassine Lakhnech, Van Chan Ngo