Sciweavers

131 search results - page 15 / 27
» Solution Enumeration for Projected Boolean Search Problems
Sort
View
ANOR
2004
79views more  ANOR 2004»
13 years 6 months ago
Preference-Based Search and Multi-Criteria Optimization
Many real-world AI problems (e.g. in configuration) are weakly constrained, thus requiring a mechanism for characterizing and finding the preferred solutions. Preferencebased sear...
Ulrich Junker
SIGMOD
2009
ACM
161views Database» more  SIGMOD 2009»
14 years 1 months ago
Dependency-aware reordering for parallelizing query optimization in multi-core CPUs
The state of the art commercial query optimizers employ cost-based optimization and exploit dynamic programming (DP) to find the optimal query execution plan (QEP) without evalua...
Wook-Shin Han, Jinsoo Lee
FUIN
2010
93views more  FUIN 2010»
13 years 5 months ago
SAT as a Programming Environment for Linear Algebra
In this paper we present an application of the propositional SATisfiability environment to computing some simple orthogonal matrices and some interesting tasks in the area of cry...
Marian Srebrny, Lidia Stepien
ECSCW
2007
13 years 8 months ago
Tag-Based Metonymic Search in an Activity-Centric Aggregation Service
Knowledge workers often need to find, organize, and work with heterogeneous resources from diverse services, information stores, and repositories. This paper analyzes two problems ...
Michael J. Muller, Werner Geyer, Beth Brownholtz, ...
HYBRID
1994
Springer
13 years 10 months ago
Symbolic Controller Synthesis for Discrete and Timed Systems
This paper presents algorithms for the symbolic synthesis of discrete and real-time controllers. At the semantic level the controller is synthesized by nding a winning strategy for...
Eugene Asarin, Oded Maler, Amir Pnueli