903 search results - page 57 / 181 » Non-well-founded trees in categories |
112
click to vote
ATAL
2009
Springer
15 years 8 months ago
2009
Springer
We introduce an adversarial planning algorithm based on game tree search, which is applicable in large-scale multiplayer domains. In order to tackle the scalability issues of game...
112
click to vote
MKM
2009
Springer
15 years 8 months ago
2009
Springer
The extraction of the relations of nested table headers to content cells is automated with a view to constructing narrow domain ontologies of semistructured web data. A taxonomy of...
100
click to vote
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees. ...
149
click to vote
EGPGV
2004
Springer
15 years 7 months ago
2004
Springer
We present a new parallel multiresolution volume rendering algorithm for visualizing large data sets. Using the wavelet transform, the raw data is first converted into a multires...
118
click to vote
GLVLSI
2003
IEEE
15 years 7 months ago
2003
IEEE
In dense integrated circuit designs, management of routing congestion is essential; an over congested design may be unroutable. Many factors influence congestion: placement, rout...