2080 search results - page 322 / 416 » Measuring empirical computational complexity |
173
click to vote
GECCO
2007
Springer
16 years 14 days ago
2007
Springer
The application of resource-defined fitness sharing (RFS) to shape nesting problems reveals a remarkable ability to discover tilings [7, 8]. These tilings represent exact covers...
180
click to vote
SDM
2008
SIAM
15 years 7 months ago
2008
SIAM
It has long been noted that many data mining algorithms can be built on top of join algorithms. This has lead to a wealth of recent work on efficiently supporting such joins with ...
201
click to vote
UAI
2008
15 years 7 months ago
2008
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
191
click to vote
ICDM
2009
IEEE
15 years 4 months ago
2009
IEEE
Being able to incorporate, inspect, and analyze data with newly developed technologies, diagnostics, and visualizations in an easy and flexible way has been a longstanding challen...
159
click to vote
ICML
1998
IEEE
16 years 7 months ago
1998
IEEE
In a recent paper, Friedman, Geiger, and Goldszmidt [8] introduced a classifier based on Bayesian networks, called Tree Augmented Naive Bayes (TAN), that outperforms naive Bayes a...