Sciweavers

594 search results - page 32 / 119
» Heuristic Measures of Interestingness
Sort
View
ISSE
2008
13 years 8 months ago
Matching object catalogues
A catalogue holds information about a set of objects, typically classified using terms taken from a given thesaurus, and described with the help of a set of attributes. Matching a ...
Luiz André P. Paes Leme, Daniela F. Brauner...
OSS
2009
Springer
14 years 3 months ago
Estimating Commit Sizes Efficiently
The quantitative analysis of software projects can provide insights that let us better understand open source and other software development projects. An important variable used in...
Philipp Hofmann, Dirk Riehle
GECCO
2007
Springer
158views Optimization» more  GECCO 2007»
14 years 2 months ago
Continuous lunches are free!
This paper investigates extensions of No Free Lunch (NFL) theorems to countably infinite and uncountable infinite domains. The original NFL due to Wolpert and Macready states th...
Anne Auger, Olivier Teytaud
IBERAMIA
2004
Springer
14 years 2 months ago
Constrainedness and Redundancy by Constraint Ordering
Abstract. In constraint satisfaction, a general rule is to tackle the hardest part of a search problem first. In this paper, we introduce a parameter (τ) that measures the constr...
Miguel A. Salido, Federico Barber
AIPS
2006
13 years 10 months ago
Resource Contention Metrics for Oversubscribed Scheduling Problems
We investigate a task insertion heuristic for oversubscribed scheduling problems, max-availability, that uses a simple estimate of resource contention to assign tasks to intervals...
Laurence A. Kramer, Stephen F. Smith