903 search results - page 76 / 181 » Non-well-founded trees in categories |
176
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
One problem that has plagued Genetic Programming (GP) and its derivatives is numerical constant creation. Given a mathematical formula expressed as a tree structure, the leaf node...
171
click to vote
EGH
2009
Springer
15 years 4 months ago
2009
Springer
A major factor for the efficiency of ray tracing is the use of good acceleration structures. Recently, bounding volume hierarchies (BVHs) have become the preferred acceleration st...
192
click to vote
EDBT
2011
ACM
14 years 9 months ago
2011
ACM
Most known frequent item set mining algorithms work by enumerating candidate item sets and pruning infrequent candidates. An alternative method, which works by intersecting transa...
179
click to vote
KDD
2012
ACM
13 years 8 months ago
2012
ACM
With the wide deployment of smart card automated fare collection (SCAFC) systems, public transit agencies have been benefiting from huge volume of transit data, a kind of sequent...
227
click to vote
FOCS
1997
IEEE
15 years 10 months ago
1997
IEEE
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...