Sciweavers

1798 search results - page 154 / 360
» A Tree for All Seasons
Sort
View
AAAI
1996
13 years 10 months ago
A Graph-Based Method for Improving GSAT
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
Kalev Kask, Rina Dechter
TAMODIA
2007
13 years 10 months ago
From Task to Dialog Model in the UML
Many model-based approaches for user interface design start from a task model, for which the ConcurTaskTrees notation is frequently used. Despite this popularity and the importance...
Jan Van den Bergh, Karin Coninx
WCE
2007
13 years 10 months ago
Models of Adding Relations to a Linking Pin Type Organization Structure
—This paper proposes two models of adding relations to a linking pin type organization structure where every pair of siblings in a complete Kary tree of height H is adjacent: (i)...
Kiyoshi Sawada
CORR
2010
Springer
133views Education» more  CORR 2010»
13 years 9 months ago
On Byzantine Containment Properties of the $min+1$ Protocol
Self-stabilization is a versatile approach to fault-tolerance since it permits a distributed system to recover from any transient fault that arbitrarily corrupts the contents of a...
Swan Dubois, Toshimitsu Masuzawa, Sébastien...
ENTCS
2008
103views more  ENTCS 2008»
13 years 9 months ago
Systematic Semantic Tableaux for PLTL
The better known methods of semantic tableaux for deciding satisfiability in propositional linear temporal logic generate graphs in addition to classical trees. The test of satisf...
Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, M...