Sciweavers

3223 search results - page 393 / 645
» The Scaling of Search Cost
Sort
View
AIPS
2003
15 years 8 months ago
Reasoning about Autonomous Processes in an Estimated-Regression Planner
We examine the issues that arise in extending an estimatedregression (ER) planner to reason about autonomous processes that run and have continuous and discrete effects without th...
Drew V. McDermott
IJCAI
2003
15 years 8 months ago
Maximizing Flexibility: A Retraction Heuristic for Oversubscribed Scheduling Problems
In this paper we consider the solution of scheduling problems that are inherently over-subscribed. In such problems, there are always more tasks to execute within a given time fra...
Laurence A. Kramer, Stephen F. Smith
ICMCS
2010
IEEE
169views Multimedia» more  ICMCS 2010»
15 years 7 months ago
Comparison of clustering approaches for summarizing large populations of images
This paper compares the efficacy and efficiency of different clustering approaches for selecting a set of exemplar images, to present in the context of a semantic concept. We eval...
Yushi Jing, Michele Covell, Henry A. Rowley
MM
2010
ACM
221views Multimedia» more  MM 2010»
15 years 6 months ago
Building book inventories using smartphones
Manual generation of a book inventory is time-consuming and tedious, while deployment of barcode and radio-frequency identification (RFID) management systems is costly and afforda...
David M. Chen, Sam S. Tsai, Bernd Girod, Cheng-Hsi...
ECEASST
2006
305views more  ECEASST 2006»
15 years 6 months ago
The ParMol Package for Frequent Subgraph Mining
Mining for frequent subgraphs in a graph database has become a popular topic in the last years. Algorithms to solve this problem are used in chemoinformatics to find common molecul...
Thorsten Meinl, Marc Wörlein, Olga Urzova, In...