Sciweavers

74 search results - page 9 / 15
» Efficiently evolving programs through the search for novelty
Sort
View
OSDI
2008
ACM
14 years 8 months ago
Finding and Reproducing Heisenbugs in Concurrent Programs
Concurrency is pervasive in large systems. Unexpected interference among threads often results in "Heisenbugs" that are extremely difficult to reproduce and eliminate. W...
Gérard Basler, Iulian Neamtiu, Madanlal Mus...
ENTCS
2008
132views more  ENTCS 2008»
13 years 7 months ago
Distributed Verification of Multi-threaded C++ Programs
Verification of multi-threaded C++ programs poses three major challenges: the large number of states, states with huge sizes, and time intensive expansions of states. This paper p...
Stefan Edelkamp, Shahid Jabbar, Damian Sulewski
SAC
2006
ACM
13 years 7 months ago
Efficient interactive configuration of unbounded modular systems
Interactive configuration guides a user searching through a large combinatorial space of solutions to a system of constraints. We investigate a class of very expressive underlying...
Erik Roland van der Meer, Andrzej Wasowski, Henrik...
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
14 years 8 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
LION
2010
Springer
209views Optimization» more  LION 2010»
14 years 12 days ago
Feature Extraction from Optimization Data via DataModeler's Ensemble Symbolic Regression
We demonstrate a means of knowledge discovery through feature extraction that exploits the search history of an optimization run. We regress a symbolic model ensemble from optimiza...
Kalyan Veeramachaneni, Katya Vladislavleva, Una-Ma...