1012 search results - page 148 / 203 » Segment intersection searching problems in general settings |
103
click to vote
AAAI
1993
15 years 1 months ago
1993
learning (EBL) component. In this paper we provide a brief review of FOIL and FOCL, then discuss how operationalizing a domain theory can adversely affect the accuracy of a learned...
139
click to vote
ASE
1998
14 years 11 months ago
1998
The process of understanding a source code in a high-level programming language involves complex computation. Given a piece of legacy code and a library of program plan templates, ...
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
The success of evolutionary algorithms (EAs) depends crucially on finding suitable parameter settings. Doing this by hand is a very time consuming job without the guarantee to ...
103
click to vote
GPEM
2002
14 years 11 months ago
2002
In this paper we use genetic programming for changing the representation of the input data for machine learners. In particular, the topic of interest here is feature construction i...
COMPGEOM
2007
ACM
15 years 3 months ago
2007
ACM
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...