Sciweavers

3742 search results - page 644 / 749
» On the Use of Formal Techniques for Validation
Sort
View
AAAI
2000
15 years 7 months ago
Asynchronous Search with Aggregations
Many problem-solving tasks can be formalized as constraint satisfaction problems (CSPs). In a multi-agent setting, information about constraints and variables may belong to differ...
Marius-Calin Silaghi, Djamila Sam-Haroud, Boi Falt...
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
15 years 7 months ago
Typical random 3-SAT formulae and the satisfiability threshold
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
Olivier Dubois, Yacine Boufkhad, Jacques Mandler
AAAI
1994
15 years 7 months ago
Forming Beliefs about a Changing World
The situation calculus is a popular technique for reasoning about action and change. However, its restriction to a firstorder syntax and pure deductive reasoning makes it unsuitab...
Fahiem Bacchus, Adam J. Grove, Joseph Y. Halpern, ...
AAAI
1994
15 years 7 months ago
Case-Based Acquisition of User Preferences for Solution Improvement in Ill-Structured Domains
1 We have developed an approach to acquire complicated user optimization criteria and use them to guide iterative solution improvement. The eectiveness of the approach was tested ...
Katia P. Sycara, Kazuo Miyashita
UAI
1996
15 years 7 months ago
Context-Specific Independence in Bayesian Networks
Bayesiannetworks provide a languagefor qualitatively representing the conditional independence properties of a distribution. This allows a natural and compact representation of th...
Craig Boutilier, Nir Friedman, Moisés Golds...