Sciweavers

2912 search results - page 157 / 583
» Logistic Model Trees
Sort
View
142
Voted
WDAG
2001
Springer
107views Algorithms» more  WDAG 2001»
15 years 8 months ago
Self-Stabilizing Minimum Spanning Tree Construction on Message-Passing Networks
Self-stabilizing algorithms for constructing a spanning tree of an arbitrary network have been studied for many models of distributed networks including those that communicate via ...
Lisa Higham, Zhiying Liang
135
Voted
ATVA
2008
Springer
90views Hardware» more  ATVA 2008»
15 years 5 months ago
Tree Pattern Rewriting Systems
Classical verification often uses abstraction when dealing with data. On the other hand, dynamic XML-based applications have become pervasive, for instance with the ever growing im...
Blaise Genest, Anca Muscholl, Olivier Serre, Marc ...
126
Voted
CIKM
2008
Springer
15 years 5 months ago
Trada: tree based ranking function adaptation
Machine Learned Ranking approaches have shown successes in web search engines. With the increasing demands on developing effective ranking functions for different search domains, ...
Keke Chen, Rongqing Lu, C. K. Wong, Gordon Sun, La...
129
Voted
AAAI
2006
15 years 5 months ago
Overconfidence or Paranoia? Search in Imperfect-Information Games
We derive a recursive formula for expected utility values in imperfect- information game trees, and an imperfectinformation game tree search algorithm based on it. The formula and...
Austin Parker, Dana S. Nau, V. S. Subrahmanian
137
Voted
ATVA
2007
Springer
115views Hardware» more  ATVA 2007»
15 years 9 months ago
A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains
Abstract. Dynamic fault trees (DFTs) are a versatile and common formalism to model and analyze the reliability of computer-based systems. This paper presents a formal semantics of ...
Hichem Boudali, Pepijn Crouzen, Mariëlle Stoe...