Sciweavers

510 search results - page 17 / 102
» How Should We Solve Search Problems Privately
Sort
View
EOR
2007
101views more  EOR 2007»
13 years 7 months ago
Searching for multiobjective preventive maintenance schedules: Combining preferences with evolutionary algorithms
Heavy industry maintenance facilities at aircraft service centers or railroad yards must contend with scheduling preventive maintenance tasks to ensure critical equipment remains ...
Gang Quan, Garrison W. Greenwood, Donglin Liu, Xia...
SEMWEB
2007
Springer
14 years 1 months ago
A Survey and Categorization of Ontology Matching Cases
Methodologies to find and evaluate solutions for ontology matching should be centered on the practical problems to be solved. In this paper we look at matching from the perspectiv...
Zharko Aleksovski, Willem Robert van Hage, Antoine...
UAI
2008
13 years 9 months ago
Bounding Search Space Size via (Hyper)tree Decompositions
This paper develops a measure for bounding the performance of AND/OR search algorithms for solving a variety of queries over graphical models. We show how drawing a connection to ...
Lars Otten, Rina Dechter
CORR
2006
Springer
95views Education» more  CORR 2006»
13 years 7 months ago
SAT Solving for Argument Filterings
Abstract. This paper introduces a propositional encoding for lexicographic path orders in connection with dependency pairs. This facilitates the application of SAT solvers for term...
Michael Codish, Peter Schneider-Kamp, Vitaly Lagoo...
AAAI
2006
13 years 9 months ago
Focused Real-Time Dynamic Programming for MDPs: Squeezing More Out of a Heuristic
Real-time dynamic programming (RTDP) is a heuristic search algorithm for solving MDPs. We present a modified algorithm called Focused RTDP with several improvements. While RTDP ma...
Trey Smith, Reid G. Simmons