Sciweavers

4095 search results - page 112 / 819
» How to test a tree
Sort
View
ACG
2009
Springer
14 years 4 months ago
Monte-Carlo Tree Search in Settlers of Catan
Abstract. Games are considered important benchmark tasks of artificial intelligence research. Modern strategic board games can typically be played by three or more people, which m...
Istvan Szita, Guillaume Chaslot, Pieter Spronck
LICS
2002
IEEE
14 years 3 months ago
Tree Extension Algebras: Logics, Automata, and Query Languages
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
Michael Benedikt, Leonid Libkin
NETWORKING
2000
13 years 11 months ago
An Algorithm for Multicast with Multiple QoS Constraints and Dynamic Membership
In this paper we present an algorithm to construct low-cost source trees for multicast with multiple QoS constraints and dynamic membership. Assuming the availability of link-state...
Aiguo Fei, Mario Gerla
JCB
2007
145views more  JCB 2007»
13 years 10 months ago
Confounding Factors in HGT Detection: Statistical Error, Coalescent Effects, and Multiple Solutions
Prokaryotic organisms share genetic material across species boundaries by means of a process known as horizontal gene transfer (HGT). This process has great significance for unde...
Cuong Than, Derek A. Ruths, Hideki Innan, Luay Nak...
FUIN
2010
172views more  FUIN 2010»
13 years 7 months ago
Bounded Parametric Verification for Distributed Time Petri Nets with Discrete-Time Semantics
Bounded Model Checking (BMC) is an efficient technique applicable to verification of temporal properties of (timed) distributed systems. In this paper we show for the first time ho...
Michal Knapik, Wojciech Penczek, Maciej Szreter, A...