903 search results - page 80 / 181 » Non-well-founded trees in categories |
163
click to vote
GECCO
2010
Springer
15 years 9 months ago
2010
Springer
We use affine arithmetic to improve both the performance and the robustness of genetic programming for symbolic regression. During evolution, we use affine arithmetic to analyze e...
200
click to vote
ICDT
2010
ACM
15 years 8 months ago
2010
ACM
When a query is evaluated under bag semantics, each answer is returned as many times as it has derivations. Bag semantics has long been recognized as important, especially when ag...
186
click to vote
AOSD
2008
ACM
15 years 8 months ago
2008
ACM
Aspect-oriented programming languages provide new composition mechanisms for improving the modularity of crosscutting concerns. Implementations of such language support use advanc...
146
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
We present Tartanian, a game theory-based player for headsup no-limit Texas Hold'em poker. Tartanian is built from three components. First, to deal with the virtually infinit...
142
click to vote
C3S2E
2008
ACM
15 years 8 months ago
2008
ACM
We take another look at the 2DR-tree. In particular, we revisit its node structure, validity rules and the insertion strategy. The 2DR-tree uses 2D nodes so that the relationships...