509 search results - page 55 / 102 » On the completeness of compositional reasoning methods |
DLOG
1996
1996
Resolving Semantic Heterogeneity in Databases with a Terminological Model: Correspondence Refinement
13 years 10 months ago
The success of schema integration in multidatabase systems relies heavily on the determination of complete and refined correspondence relationships between them. So, the candidate...
UAI
2000
13 years 10 months ago
2000
Cooperative games are those in which both agents share the same payoff structure. Valuebased reinforcement-learning algorithms, such as variants of Q-learning, have been applied t...
ICCD
2004
IEEE
14 years 5 months ago
2004
IEEE
Abstract— This paper proposes a technique for creating a combinational logic network with an output that signals when all other outputs have stabilized. The method is based on du...
CP
2005
Springer
14 years 2 months ago
2005
Springer
Local search is a powerful and well-established method for solving hard combinatorial problems. Yet, until recently, it has provided very little user support, leading to time-consu...
ECOOP
1993
Springer
14 years 29 days ago
1993
Springer
This paper proposes a formalism for reasoning about distributed object-oriented computations. The formalism is an extension of Milner’s CCS with the notion of local time. It allo...