Sciweavers

4095 search results - page 340 / 819
» How to test a tree
Sort
View
GECCO
2008
Springer
152views Optimization» more  GECCO 2008»
15 years 6 months ago
Accelerating genetic programming by frequent subtree mining
One crucial issue in genetic programming (GP) is how to acquire promising building blocks efficiently. In this paper, we propose a GP method (called GPTM, GP with Tree Mining) whi...
Yoshitaka Kameya, Junichi Kumagai, Yoshiaki Kurata
AIR
2006
76views more  AIR 2006»
15 years 5 months ago
Evolved term-weighting schemes in Information Retrieval: an analysis of the solution space
Evolutionary computation techniques are increasingly being applied to problems within Information Retrieval (IR). Genetic programming (GP) has previously been used with some succe...
Ronan Cummins, Colm O'Riordan
163
Voted
CORR
2007
Springer
147views Education» more  CORR 2007»
15 years 5 months ago
Decomposition During Search for Propagation-Based Constraint Solvers
Abstract. We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically ...
Martin Mann, Guido Tack, Sebastian Will
IANDC
2007
96views more  IANDC 2007»
15 years 5 months ago
A general mathematics of names
We introduce FMG (Fraenkel-Mostowski Generalised) set theory, a generalisation of FM set theory which allows binding of infinitely many names instead of just finitely many names...
Murdoch Gabbay
CGF
2004
108views more  CGF 2004»
15 years 5 months ago
Interference Detection for Subdivision Surfaces
Accurate and robust interference detection and ray-tracing of subdivision surfaces requires safe linear approximations. Approximation of the limit surface by the subdivided contro...
Xiaobin Wu, Jörg Peters