Sciweavers

634 search results - page 28 / 127
» Completion Procedures as Semidecision Procedures
Sort
View
132
Voted
DLOG
2009
15 years 17 days ago
Relativizing Concept Descriptions to Comparison Classes
Context-sensitivity has been for long a subject of study in linguistics, logic and computer science. Recently the problem of representing and reasoning with contextual knowledge ha...
Szymon Klarman, Stefan Schlobach
117
Voted
IJCAI
1997
15 years 4 months ago
Equational Reasoning using AC Constraints
Unfailing completion is a commonly used technique for equational reasoning. For equational problems with associative and commutative functions, unfailing completion often generate...
David A. Plaisted, Yunshan Zhu
139
Voted
ATAL
2007
Springer
15 years 9 months ago
A complete distributed constraint optimization method for non-traditional pseudotree arrangements
Distributed Constraint Optimization (DCOP) is a general framework that can model complex problems in multi-agent systems. Several current algorithms that solve general DCOP instan...
James Atlas, Keith Decker
111
Voted
HICSS
2010
IEEE
208views Biometrics» more  HICSS 2010»
15 years 9 months ago
Using Personality Factors to Predict Interface Learning Performance
This current study explored the impact of individual differences in personality factors on interface interaction and learning performance in both an interactive visualization and ...
Tera Marie Green, Dong Hyun Jeong, Brian Fisher
123
Voted
SIAMSC
2010
132views more  SIAMSC 2010»
15 years 1 months ago
New Algorithms for Optimal Online Checkpointing
Frequently, the computation of derivatives for optimizing time-dependent problems is based on the integration of the adjoint differential equation. For this purpose, the knowledge...
Philipp Stumm, Andrea Walther