Sciweavers

1012 search results - page 202 / 203
» Segment intersection searching problems in general settings
Sort
View
ATAL
2010
Springer
13 years 8 months ago
Using counterfactual regret minimization to create competitive multiplayer poker agents
Games are used to evaluate and advance Multiagent and Artificial Intelligence techniques. Most of these games are deterministic with perfect information (e.g. Chess and Checkers)....
Nicholas Abou Risk, Duane Szafron
GECCO
2008
Springer
199views Optimization» more  GECCO 2008»
13 years 8 months ago
Analysis of multi-objective evolutionary algorithms to optimize dynamic data types in embedded systems
New multimedia embedded applications are increasingly dynamic, and rely on Dynamically-allocated Data Types (DDTs) to store their data. The optimization of DDTs for each target em...
José Ignacio Hidalgo, José L. Risco-...
SIGIR
2008
ACM
13 years 7 months ago
A new probabilistic retrieval model based on the dirichlet compound multinomial distribution
The classical probabilistic models attempt to capture the Ad hoc information retrieval problem within a rigorous probabilistic framework. It has long been recognized that the prim...
Zuobing Xu, Ram Akella
CORR
2002
Springer
166views Education» more  CORR 2002»
13 years 7 months ago
Quantum Time-Space Tradeoffs for Sorting
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Hartmut Klauck
CIKM
2010
Springer
13 years 6 months ago
Multi-view clustering with constraint propagation for learning with an incomplete mapping between views
Multi-view learning algorithms typically assume a complete bipartite mapping between the different views in order to exchange information during the learning process. However, ma...
Eric Eaton, Marie desJardins, Sara Jacob