Sciweavers

2905 search results - page 56 / 581
» Formal Memetic Algorithms
Sort
View
105
Voted
AICCSA
2006
IEEE
95views Hardware» more  AICCSA 2006»
15 years 7 months ago
DEPICT: A High-Level Formal Language For Modeling Constraint Satisfaction Problems
: The past decade witnessed rapid development of constraint satisfaction technologies, where algorithms are now able to cope with larger and harder problems. However, owing to the ...
Abdulwahed M. Abbas, Edward P. K. Tsang, Ahmad H. ...
ASM
2008
ASM
15 years 3 months ago
The High Road to Formal Validation:
Abstract. In this paper we examine the difference between model checking high-level and low-level models. In particular, we compare the ProB model checker for the B-method and the ...
Michael Leuschel
90
Voted
IWFM
1998
15 years 2 months ago
Formal Engineering of the Bitonic Sort using PVS
In this paper, we present a proof that the bitonic sort is sound using PVS, a powerful specification and verification environment. First, we briefly introduce this well-known para...
Raphaël Couturier
78
Voted
COLING
1996
15 years 2 months ago
Compiling a Partition-Based Two-Level Formalism
This paper describes an algorithm for the compilation of a two (or more) level orthographic or phonological rule notation into finite state transducers. The notation is an alterna...
Edmund Grimley-Evans, George Anton Kiraz, Stephen ...
91
Voted
EACL
1989
ACL Anthology
15 years 2 months ago
Expressing generalizations in unification-based grammar formalisms
This paper shows how higher levels of generalization can be introduced into unification grammars by exploiting methods for typing grammatical objects. We discuss the strategy of u...
Marc Moens, Jonathan Calder, Ewan Klein, Mike Reap...