Sciweavers

5144 search results - page 364 / 1029
» Enhancing Search with Structure
Sort
View
AIPS
2011
14 years 10 months ago
Heuristic Search for Generalized Stochastic Shortest Path MDPs
Research in efficient methods for solving infinite-horizon MDPs has so far concentrated primarily on discounted MDPs and the more general stochastic shortest path problems (SSPs...
Andrey Kolobov, Mausam, Daniel S. Weld, Hector Gef...
CIDM
2009
IEEE
16 years 1 months ago
A new hybrid method for Bayesian network learning With dependency constraints
Abstract— A Bayes net has qualitative and quantitative aspects: The qualitative aspect is its graphical structure that corresponds to correlations among the variables in the Baye...
Oliver Schulte, Gustavo Frigo, Russell Greiner, We...
LION
2007
Springer
198views Optimization» more  LION 2007»
16 years 28 days ago
Multiobjective Landscape Analysis and the Generalized Assignment Problem
The importance of tuning a search algorithm for the specific features of the target search space has been known for quite some time. However, when dealing with multiobjective prob...
Deon Garrett, Dipankar Dasgupta
FOCS
2000
IEEE
15 years 11 months ago
Nearly Optimal Expected-Case Planar Point Location
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision t...
Sunil Arya, Theocharis Malamatos, David M. Mount
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
16 years 8 hour ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen