Sciweavers

9626 search results - page 419 / 1926
» Invariant Based Programming
Sort
View
FCT
2007
Springer
16 years 28 days ago
Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...
Stavros Athanassopoulos, Ioannis Caragiannis, Chri...
OOPSLA
2004
Springer
16 years 4 days ago
Efficient data race and deadlock prevention in concurrent object-oriented programs
The main goal of this PhD thesis is to propose and implement a methodology for the construction of programs based on the SCOOP model, and for modular reasoning about their correct...
Piotr Nienaltowski
GECCO
2010
Springer
182views Optimization» more  GECCO 2010»
15 years 11 months ago
Model selection in genetic programming
Abstract. We discuss the problem of model selection in Genetic Programming using the framework provided by Statistical Learning Theory, i.e. Vapnik-Chervonenkis theory (VC). We pre...
Cruz E. Borges, César Luis Alonso, Jos&eacu...
ICSE
2010
IEEE-ACM
15 years 11 months ago
Eliminating dead-code from XQuery programs
One of the challenges in web software development is to help achieving a good level of quality in terms of code size and runtime performance, for increasingly popular domain speci...
Pierre Genevès, Nabil Layaïda
CEC
2009
IEEE
15 years 11 months ago
Grammar-based genetic programming for timetabling
Abstract— We present a grammar-based genetic programming framework for the solving the timetabling problem via the evolution of constructive heuristics. The grammar used for prod...
Mohamed Bahy El Bader-El-Den, Riccardo Poli