67 search results - page 9 / 14 » Empirical Evaluation of Four Tensor Decomposition Algorithms |
JMLR
2010
13 years 2 months ago
2010
We present two Bayesian algorithms CD-B and CD-H for discovering unconfounded cause and effect relationships from observational data without assuming causal sufficiency which prec...
GECCO
2010
Springer
14 years 7 days ago
2010
Springer
For many large-scale combinatorial search/optimization problems, meta-heuristic algorithms face noisy objective functions, coupled with computationally expensive evaluation times....
ILP
2003
Springer
14 years 19 days ago
2003
Springer
It is well known that many hard tasks considered in machine learning and data mining can be solved in an rather simple and robust way with an instance- and distance-based approach....
ATAL
2010
Springer
13 years 5 months ago
2010
Springer
We present an agent-based coordination and planning method for aerial surveillance of multiple urban areas using a group of fixed-wing unmanned aerial vehicles (UAVs). The method ...
ML
2006
ACM
13 years 7 months ago
2006
ACM
Bridge bidding is considered to be one of the most difficult problems for game-playing programs. It involves four agents rather than two, including a cooperative agent. In additio...