Sciweavers

4095 search results - page 83 / 819
» How to test a tree
Sort
View
EUROGP
2001
Springer
106views Optimization» more  EUROGP 2001»
14 years 2 months ago
Linear-Tree GP and Its Comparison with Other GP Structures
Abstract. In recent years different genetic programming (GP) structures have emerged. Today, the basic forms of representation for genetic programs are tree, linear and graph stru...
Wolfgang Kantschik, Wolfgang Banzhaf
INFORMS
2006
87views more  INFORMS 2006»
13 years 10 months ago
Early Estimates of the Size of Branch-and-Bound Trees
This paper intends to show that the time needed to solve mixed integer programming problems by branch and bound can be roughly predicted early in the solution process. We construc...
Gérard Cornuéjols, Miroslav Karamano...
GECCO
2004
Springer
152views Optimization» more  GECCO 2004»
14 years 3 months ago
Ant System for the k-Cardinality Tree Problem
This paper gives an algorithm for finding the minimum weight tree having k edges in an edge weighted graph. The algorithm combines a search and optimization technique based on phe...
Thang Nguyen Bui, Gnanasekaran Sundarraj
KI
2004
Springer
14 years 3 months ago
Generation of Sentence Parse Trees Using Parts of Speech
This paper proposes a new corpus-based approach for deriving syntactic structures and generating parse trees of natural language sentences. The parts of speech (word categories) of...
Tunga Güngör
DIWEB
2001
13 years 11 months ago
Integration of XML Data in XPathLog
XPathLog is a logic-based language for manipulating and integrating XML data. It extends the XPath query language with Prolog-style variables. Due to the close relationship with X...
Wolfgang May