Sciweavers

1940 search results - page 142 / 388
» Search with Synonyms: Problems and Solutions
Sort
View
AAAI
2006
15 years 7 months ago
Solving MAP Exactly by Searching on Compiled Arithmetic Circuits
The MAP (maximum a posteriori hypothesis) problem in Bayesian networks is to find the most likely states of a set of variables given partial evidence on the complement of that set...
Jinbo Huang, Mark Chavira, Adnan Darwiche
TSP
2008
100views more  TSP 2008»
15 years 6 months ago
Optimal Two-Stage Search for Sparse Targets Using Convex Criteria
We consider the problem of estimating and detecting sparse signals over a large area of an image or other medium. We introduce a novel cost function that captures the tradeoff bet...
Eran Bashan, Raviv Raich, Alfred O. Hero III
PPSN
2010
Springer
15 years 4 months ago
Towards Analyzing Recombination Operators in Evolutionary Search
Recombination (also called crossover) operators are widely used in EAs to generate offspring solutions. Although the usefulness of recombination has been well recognized, theoretic...
Yang Yu, Chao Qian, Zhi-Hua Zhou
SSD
2009
Springer
127views Database» more  SSD 2009»
15 years 11 months ago
Incremental Reverse Nearest Neighbor Ranking in Vector Spaces
In this paper, we formalize the novel concept of incremental reverse nearest neighbor ranking and suggest an original solution for this problem. We propose an efficient approach f...
Tobias Emrich, Hans-Peter Kriegel, Peer Kröge...
EOR
2010
116views more  EOR 2010»
15 years 6 months ago
Speeding up continuous GRASP
Continuous GRASP (C-GRASP) is a stochastic local search metaheuristic for finding cost-efficient solutions to continuous global optimization problems subject to box constraints (Hi...
Michael J. Hirsch, Panos M. Pardalos, Mauricio G. ...