Sciweavers

1041 search results - page 106 / 209
» Randomizing Reductions of Search Problems
Sort
View
ACII
2005
Springer
13 years 10 months ago
Simulated Annealing Based Hand Tracking in a Discrete Space
Hand tracking is a challenging problem due to the complexity of searching in a 20+ degrees of freedom (DOF) space for an optimal estimation of hand configuration. This paper repres...
Wei Liang, Yunde Jia, Yang Liu, Cheng Ge
PPSN
2004
Springer
14 years 1 months ago
Optimization via Parameter Mapping with Genetic Programming
Abstract. This paper describes a new approach for parameter optimization that uses a novel representation for the parameters to be optimized. By using genetic programming, the new ...
João Carlos Figueira Pujol, Riccardo Poli
ATAL
2010
Springer
13 years 9 months ago
Heuristic search for identical payoff Bayesian games
Bayesian games can be used to model single-shot decision problems in which agents only possess incomplete information about other agents, and hence are important for multiagent co...
Frans A. Oliehoek, Matthijs T. J. Spaan, Jilles St...
CIKM
2005
Springer
14 years 1 months ago
Joint deduplication of multiple record types in relational data
Record deduplication is the task of merging database records that refer to the same underlying entity. In relational databases, accurate deduplication for records of one type is o...
Aron Culotta, Andrew McCallum
CORR
2010
Springer
107views Education» more  CORR 2010»
13 years 6 months ago
Maximum Betweenness Centrality: Approximability and Tractable Cases
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
Martin Fink, Joachim Spoerhase