Sciweavers

6960 search results - page 368 / 1392
» Continuity Analysis of Programs
Sort
View
139
Voted
IJISTA
2007
119views more  IJISTA 2007»
15 years 4 months ago
Online modelling based on Genetic Programming
: Genetic Programming (GP), a heuristic optimisation technique based on the theory of Genetic Algorithms (GAs), is a method successfully used to identify non-linear model structure...
Stephan M. Winkler, Hajrudin Efendic, Luigi del Re...
ANOR
2005
94views more  ANOR 2005»
15 years 4 months ago
Cover and Pack Inequalities for (Mixed) Integer Programming
We review strong inequalities for fundamental knapsack relaxations of (mixed) integer programs. These relaxations are the 0-1 knapsack set, the mixed 0-1 knapsack set, the integer ...
Alper Atamtürk
ACTAC
2002
99views more  ACTAC 2002»
15 years 4 months ago
Recognizing Design Patterns in C++ Programs with the Integration of Columbus and Maisa
A method for recognizing design patterns from C++ programs is presented. The method consists of two separate phases, analysis and reverse engineering of the C++ code, and architec...
Rudolf Ferenc, Juha Gustafsson, Lászl&oacut...
STTT
2002
69views more  STTT 2002»
15 years 4 months ago
Program model checking as a new trend
This paper introduces a special section of the STTT journal containing a selection of papers that were presented at the 7th International SPIN workshop, Stanford, August 30 - Septe...
Klaus Havelund, Willem Visser
SPIN
2010
Springer
15 years 3 months ago
An Automata-Based Symbolic Approach for Verifying Programs on Relaxed Memory Models
This paper addresses the problem of verifying programs for the relaxed memory models implemented in modern processors. Specifically, it considers the TSO (Total Store Order) relax...
Alexander Linden, Pierre Wolper