89 search results - page 11 / 18 » Abstraction Heuristics Extended with Counting Abstractions |
GECCO
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. In this paper, we review some classical recombination operations and devise new heuristic recombinations for the fixed-length subset. Our experimental results on the cla...
98
Voted
JSAC
2007
14 years 9 months ago
2007
Abstract— In this paper we consider the problem of provisioning spare capacity in two-layer backbone networks using shared backup path protection. First, two spare capacity alloc...
ECAI
1998
Springer
15 years 1 months ago
1998
Springer
Abstract. We extend different Description Logics by concrete domains (such as integers and reals) and by aggregation functions over these domains (such as min;max;count;sum), which...
ICDT
2005
ACM
15 years 3 months ago
2005
ACM
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
ECML
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Learning from multi-relational domains has gained increasing attention over the past few years. Inductive logic programming (ILP) systems, which often rely on hill-climbi...