Sciweavers

881 search results - page 31 / 177
» Solving satisfiability problems with preferences
Sort
View
SARA
2005
Springer
14 years 2 months ago
Approximate Model-Based Diagnosis Using Preference-Based Compilation
Abstract. This article introduces a technique for improving the efficiency of diagnosis through approximate compilation. We extend the approach of compiling a diagnostic model, as...
Gregory M. Provan
ENTCS
2010
136views more  ENTCS 2010»
13 years 6 months ago
A Solver for Modal Fixpoint Logics
We present MLSolver, a tool for solving the satisfiability and validity problems for modal fixpoint logics. The underlying technique is based on characterisations of satisfiabilit...
Oliver Friedmann, Martin Lange
ICRA
2003
IEEE
101views Robotics» more  ICRA 2003»
14 years 1 months ago
A Branch-and-Prune Algorithm for Solving Systems of Distance Constraints
— Given a set of affine varieties in ℜ3, i.e. planes, lines, and points, the problem tackled in this paper is that of finding all possible configurations for these varieties...
Josep M. Porta, Federico Thomas, Lluís Ros,...
ATAL
2008
Springer
13 years 10 months ago
The permutable POMDP: fast solutions to POMDPs for preference elicitation
The ability for an agent to reason under uncertainty is crucial for many planning applications, since an agent rarely has access to complete, error-free information about its envi...
Finale Doshi, Nicholas Roy
GECCO
2008
Springer
155views Optimization» more  GECCO 2008»
13 years 9 months ago
Integrating user preferences with particle swarms for multi-objective optimization
This paper proposes a method to use reference points as preferences to guide a particle swarm algorithm to search towards preferred regions of the Pareto front. A decision maker c...
Upali K. Wickramasinghe, Xiaodong Li