332 search results - page 57 / 67 » An Aristotelian notion of size |
ICLP
2007
Springer
15 years 1 months ago
2007
Springer
We present a static analysis that infers both upper and lower bounds on the usage that a logic program makes of a set of user-definable resources. The inferred bounds will in gener...
COLT
2006
Springer
15 years 1 months ago
2006
Springer
Stability is a common tool to verify the validity of sample based algorithms. In clustering it is widely used to tune the parameters of the algorithm, such as the number k of clust...
FSTTCS
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We prove several results about the average-case complexity of problems in the Polynomial Hierarchy (PH). We give a connection among average-case, worst-case, and non-unif...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
Given the prominence of elite archiving in contemporary multiobjective optimisation research and the limitations inherent in bounded population sizes, it is unusual that the vast ...
ICALP
2000
Springer
15 years 1 months ago
2000
Springer
We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and partial transve...