Sciweavers

506 search results - page 53 / 102
» Automated Search for Heuristic Functions
Sort
View
TPHOL
2007
IEEE
14 years 2 months ago
Finding Lexicographic Orders for Termination Proofs in Isabelle/HOL
We present a simple method to formally prove termination of recursive functions by searching for lexicographic combinations of size measures. Despite its simplicity, the method tur...
Lukas Bulwahn, Alexander Krauss, Tobias Nipkow
ICCBR
2007
Springer
14 years 1 months ago
Label Ranking in Case-Based Reasoning
The problem of label ranking has recently been introduced as an extension of conventional classification in the field of machine learning. In this paper, we argue that label ran...
Klaus Brinker, Eyke Hüllermeier
GECCO
2005
Springer
113views Optimization» more  GECCO 2005»
14 years 1 months ago
Search-based mutation testing for Simulink models
The efficient and effective generation of test-data from high-level models is of crucial importance in advanced modern software engineering. Empirical studies have shown that muta...
Yuan Zhan, John A. Clark
EDBT
2010
ACM
184views Database» more  EDBT 2010»
13 years 9 months ago
PARINDA: an interactive physical designer for PostgreSQL
One of the most challenging tasks for the database administrator is to physically design the database to attain optimal performance for a given workload. Physical design is hard b...
Cristina Maier, Debabrata Dash, Ioannis Alagiannis...
LICS
2002
IEEE
14 years 19 days ago
Little Engines of Proof
The automated construction of mathematical proof is a basic activity in computing. Since the dawn of the field of automated reasoning, there have been two divergent schools of tho...
Natarajan Shankar