Sciweavers

5090 search results - page 411 / 1018
» Constructing Strategies for Programming
Sort
View
183
Voted
CADE
2008
Springer
16 years 7 months ago
Compositional Proofs with Symbolic Execution
Abstract. A proof method is described which combines compositional proofs of interleaved parallel programs with the intuitive and highly automatic strategy of symbolic execution. A...
Simon Bäumler, Florian Nafz, Michael Balser, ...
GECCO
2007
Springer
167views Optimization» more  GECCO 2007»
16 years 29 days ago
Genetically designed heuristics for the bin packing problem
The bin packing problem (BPP) is a real-world problem that arises in different industrial applications related to minimization of space or time. The aim of this research is to au...
Oana Muntean
GECCO
2007
Springer
175views Optimization» more  GECCO 2007»
16 years 29 days ago
Regular expression generation through grammatical evolution
This study investigates automatic regular expression generation using Grammatical Evolution. The software implementation is based on a subset of POSIX regular expression rules. Fo...
Ahmet Cetinkaya
148
Voted
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
16 years 10 days ago
Preventing overfitting in GP with canary functions
Overfitting is a fundamental problem of most machine learning techniques, including genetic programming (GP). Canary functions have been introduced in the literature as a concept ...
Nate Foreman, Matthew P. Evett
ICDAR
2003
IEEE
16 years 3 days ago
SAGENT: A Novel Technique for Document Modeling for Secure Access and Distribution
A novel strategy for the representation and manipulation of distributed documents, potentially complex and heterogeneous, is presented in this paper. The document under the propos...
Sanaul Hoque, Hossam Selim, Gareth Howells, Michae...