Sciweavers

3223 search results - page 139 / 645
» The Scaling of Search Cost
Sort
View
AIPS
2010
15 years 8 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
KDD
2012
ACM
205views Data Mining» more  KDD 2012»
13 years 9 months ago
Searching and mining trillions of time series subsequences under dynamic time warping
Most time series data mining algorithms use similarity search as a core subroutine, and thus the time taken for similarity search is the bottleneck for virtually all time series d...
Thanawin Rakthanmanon, Bilson J. L. Campana, Abdul...
SIGMOD
2006
ACM
232views Database» more  SIGMOD 2006»
16 years 6 months ago
To search or to crawl?: towards a query optimizer for text-centric tasks
Text is ubiquitous and, not surprisingly, many important applications rely on textual data for a variety of tasks. As a notable example, information extraction applications derive...
Panagiotis G. Ipeirotis, Eugene Agichtein, Pranay ...
COR
2004
139views more  COR 2004»
15 years 6 months ago
A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
The routing of a fleet of vehicles to service a set of customers is important in the field of distribution. Vehicle Routing Problems (VRP) arise in many real-life applications wit...
Sin C. Ho, Dag Haugland
ECCV
2008
Springer
16 years 8 months ago
Saliency Based Opportunistic Search for Object Part Extraction and Labeling
We study the task of object part extraction and labeling, which seeks to understand objects beyond simply identifiying their bounding boxes. We start from bottom-up segmentation of...
Yang Wu, Qihui Zhu, Jianbo Shi, Nanning Zheng