Sciweavers

1456 search results - page 16 / 292
» Two Techniques to Improve Finite Model Search
Sort
View
ERCIMDL
2008
Springer
122views Education» more  ERCIMDL 2008»
13 years 9 months ago
Improving Temporal Language Models for Determining Time of Non-timestamped Documents
Taking the temporal dimension into account in searching, i.e., using time of content creation as part of the search condition, is now gaining increasingly interest. However, in the...
Nattiya Kanhabua, Kjetil Nørvåg
AVI
2006
13 years 9 months ago
Oral messages improve visual search
Input multimodality combining speech and hand gestures has motivated numerous usability studies. Contrastingly, issues relating to the design and ergonomic evaluation of multimoda...
Suzanne Kieffer, Noelle Carbonell
AIMSA
1990
Springer
13 years 11 months ago
Compilation of Recursive Two-Literal Clauses into Unification Algorithms
: Automated deduction systems can considerably be improved by replacing axioms with special purpose inference mechanisms. For example replacing in resolution based systems certain ...
Hans Jürgen Ohlbach
CSL
2008
Springer
13 years 9 months ago
Model Transformations in Decidability Proofs for Monadic Theories
We survey two basic techniques for showing that the monadic second-order theory of a structure is decidable. In the first approach, one deals with finite fragments of the theory (g...
Wolfgang Thomas
INFORMS
1998
150views more  INFORMS 1998»
13 years 7 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper