Sciweavers

479 search results - page 2 / 96
» Learning to Improve both Efficiency and Quality of Planning
Sort
View
AIPS
2010
13 years 7 months ago
Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...
Hootan Nakhost, Martin Müller 0003
KES
2005
Springer
13 years 10 months ago
Using Relevance Feedback to Learn Both the Distance Measure and the Query in Multimedia Databases
Much of the world’s data is in the form of time series, and many other types of data, such as video, image, and handwriting, can easily be transformed into time series. This fact...
Chotirat (Ann) Ratanamahatana, Eamonn J. Keogh
FUIN
2006
139views more  FUIN 2006»
13 years 4 months ago
Efficient Parallel Query Processing by Graph Ranking
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
Dariusz Dereniowski, Marek Kubale
CIKM
2008
Springer
13 years 6 months ago
Achieving both high precision and high recall in near-duplicate detection
To find near-duplicate documents, fingerprint-based paradigms such as Broder's shingling and Charikar's simhash algorithms have been recognized as effective approaches a...
Lian'en Huang, Lei Wang, Xiaoming Li
IROS
2007
IEEE
123views Robotics» more  IROS 2007»
13 years 11 months ago
Learning humanoid reaching tasks in dynamic environments
— A central challenging problem in humanoid robotics is to plan and execute dynamic tasks in dynamic environments. Given that the environment is known, sampling-based online moti...
Xiaoxi Jiang, Marcelo Kallmann