Sciweavers

4480 search results - page 61 / 896
» Prototyping Completion with Constraints Using Computational ...
Sort
View
110
Voted
CAD
1999
Springer
15 years 3 months ago
Geometric constraint satisfaction using optimization methods
The numerical approach to solving geometric constraint problems is indispensable for building a practical CAD system. The most commonly-used numerical method is the Newton
Jian-Xin Ge, Shang-Ching Chou, Xiao-Shan Gao
129
Voted
TOPNOC
2008
15 years 3 months ago
McMillan's Complete Prefix for Contextual Nets
Abstract. In a seminal paper, McMillan proposed a technique for constructing a finite complete prefix of the unfolding of bounded (i.e., finitestate) Petri nets, which can be used ...
Paolo Baldan, Andrea Corradini, Barbara König...
STACS
2009
Springer
15 years 10 months ago
Strong Completeness of Coalgebraic Modal Logics
ABSTRACT. Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction...
Lutz Schröder, Dirk Pattinson
120
Voted
IJCAI
2003
15 years 4 months ago
Describing and Utilizing Constraints to Answer Queries in Data-Integration Systems
In data-integration systems, information sources often have various constraints such as “all houses stored at a source have a unique address.” These constraints are very usefu...
Chen Li
138
Voted
ICCBR
2001
Springer
15 years 8 months ago
Case-Based Reasoning in the Care of Alzheimer's Disease Patients
Abstract. Planning the ongoing care of Alzheimer's Disease (AD) patients is a complex task, marked by cases that change over time, multiple perspectives, and ethical issues. G...
Cynthia R. Marling, Peter Whitehouse