Sciweavers

7421 search results - page 36 / 1485
» In search of dependable design
Sort
View
FLAIRS
2008
15 years 8 months ago
Towards Getting Domain Knowledge: Plans Analysis through Investigation of Actions Dependencies
There are a lot of approaches for solving planning problems. Many of these approaches are based on `brute force` search methods and do not care about structures of plans previousl...
Lukás Chrpa, Roman Barták
CIKM
2005
Springer
15 years 11 months ago
Indexing time vs. query time: trade-offs in dynamic information retrieval systems
We examine issues in the design of fully dynamic information retrieval systems with support for instantaneous document insertions and deletions. We present one such system and dis...
Stefan Büttcher, Charles L. A. Clarke
SARA
2005
Springer
15 years 11 months ago
Solving the 24 Puzzle with Instance Dependent Pattern Databases
A pattern database (PDB) is a heuristic function in a form of a lookup table which stores the cost of optimal solutions for instances of subproblems. bproblems are generated by abs...
Ariel Felner, Amir Adler
JAIR
2006
121views more  JAIR 2006»
15 years 6 months ago
How the Landscape of Random Job Shop Scheduling Instances Depends on the Ratio of Jobs to Machines
We characterize the search landscape of random instances of the job shop scheduling problem (JSP). Specifically, we investigate how the expected values of (1) backbone size, (2) d...
Matthew J. Streeter, Stephen F. Smith
ICVS
2009
Springer
16 years 22 days ago
Learning Query-Dependent Distance Metrics for Interactive Image Retrieval
An approach to target-based image retrieval is described based on on-line rank-based learning. User feedback obtained via interaction with 2D image layouts provides qualitative co...
Junwei Han, Stephen J. McKenna, Ruixuan Wang