Sciweavers

2905 search results - page 74 / 581
» Formal Memetic Algorithms
Sort
View
FAC
2008
100views more  FAC 2008»
13 years 9 months ago
Slicing communicating automata specifications: polynomial algorithms for model reduction
Abstract. Slicing is a program analysis technique that was originally introduced to improve program debugging and understanding. The purpose of a slicing algorithm is to remove the...
Sébastien Labbé, Jean-Pierre Gallois
VL
2003
IEEE
146views Visual Languages» more  VL 2003»
14 years 2 months ago
A reading algorithm for constraint diagrams
Constraint diagrams are a visual notation designed to complement the Unified Modeling Language in the development of software systems. They generalize Venn diagrams and Euler cir...
Andrew Fish, Jean Flower, John Howse
DAGSTUHL
2006
13 years 10 months ago
An Algorithm for Matching Nondeterministic Services with Operating Guidelines
Interorganizational cooperation is more and more organized by the paradigm of services. Service-oriented architectures (SOA) provide a general framework for service interaction. SO...
Peter Massuthe, Karsten Wolf
KCAP
2005
ACM
14 years 2 months ago
Knowledge transformations between frame systems and RDB systems
For decades, researchers in knowledge representation (KR) have argued for and against various choices in KR formalisms, such as Rules, Frames, Semantic nets, and Formal logic. In ...
John H. Gennari, Peter Mork, Hao Li
WDAG
2009
Springer
77views Algorithms» more  WDAG 2009»
14 years 3 months ago
Nonblocking Algorithms and Backward Simulation
Abstract. Optimistic and nonblocking concurrent algorithms are increasingly finding their way into practical use; an important example is software transactional memory implementat...
Simon Doherty, Mark Moir