Sciweavers

217 search results - page 33 / 44
» Backdoors To Typical Case Complexity
Sort
View
93
Voted
CVPR
2006
IEEE
15 years 5 months ago
Perceptually-Inspired and Edge-Directed Color Image Super-Resolution
Inspired by multi-scale tensor voting, a computational framework for perceptual grouping and segmentation, we propose an edge-directed technique for color image superresolution gi...
Yu-Wing Tai, Wai-Shun Tong, Chi-Keung Tang
ICEIS
2006
IEEE
15 years 5 months ago
Filtering Unsatisfiable XPATH Queries
The satisfiability test checks, whether or not the evaluation of a query returns the empty set for any input document, and can be used in query optimization for avoiding the submis...
Jinghua Groppe, Sven Groppe
ATAL
2003
Springer
15 years 4 months ago
Constructing optimal policies for agents with constrained architectures
Optimal behavior is a very desirable property of autonomous agents and, as such, has received much attention over the years. However, making optimal decisions and executing optima...
Dmitri A. Dolgov, Edmund H. Durfee
84
Voted
EVOW
2003
Springer
15 years 4 months ago
Landscape State Machines: Tools for Evolutionary Algorithm Performance Analyses and Landscape/Algorithm Mapping
Abstract. Many evolutionary algorithm applications involve either fitness functions with high time complexity or large dimensionality (hence very many fitness evaluations will typi...
David Corne, Martin J. Oates, Douglas B. Kell
ML
2002
ACM
143views Machine Learning» more  ML 2002»
14 years 10 months ago
A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...
Michael J. Kearns, Yishay Mansour, Andrew Y. Ng