Sciweavers

1581 search results - page 209 / 317
» Domain semantics of possibility computations
Sort
View
IAT
2007
IEEE
15 years 7 months ago
A Multi-Phase Protocol for Negotiation with Interdependent Issues
— Multi-issue negotiations are a central component of many important coordination challenges. Almost all previous work in this area has assumed that negotiation issues are indepe...
Hiromitsu Hattori, Mark Klein, Takayuki Ito
102
Voted
CP
2007
Springer
15 years 6 months ago
Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
Christophe Lecoutre, Lakhdar Sais, Sébastie...
169
Voted
GECCO
2007
Springer
558views Optimization» more  GECCO 2007»
15 years 6 months ago
A chain-model genetic algorithm for Bayesian network structure learning
Bayesian Networks are today used in various fields and domains due to their inherent ability to deal with uncertainty. Learning Bayesian Networks, however is an NP-Hard task [7]....
Ratiba Kabli, Frank Herrmann, John McCall
ECAI
2004
Springer
15 years 6 months ago
Combining Multiple Answers for Learning Mathematical Structures from Visual Observation
Learning general truths from the observation of simple domains and, further, learning how to use this knowledge are essential capabilities for any intelligent agent to understand ...
Paulo Santos, Derek R. Magee, Anthony G. Cohn, Dav...
ECOOPW
2003
Springer
15 years 5 months ago
Modeling Variability for Object-Oriented Product Lines
The concept of a software product line is a promising approach for increasing planned reusability in industry. For planning future requirements, the integration of domain analysis ...
Matthias Riebisch, Detlef Streitferdt, Ilian Pasho...