Sciweavers

6010 search results - page 817 / 1202
» Computational Approaches to Drug Design
Sort
View
177
Voted
CAE
2007
15 years 9 months ago
memory [en]code - Building a Collective Memory within a Tabletop Installation
In this paper, we introduce memory [en]code, a project that evolved through an art+science collaboration. memory [en]code is an interactive tabletop installation that visualizes d...
Holly Schmidt, Uta Hinrichs, Alan Dunning, M. Shee...
CG
2008
Springer
15 years 8 months ago
Monte-Carlo Tree Search Solver
Recently, Monte-Carlo Tree Search (MCTS) has advanced the field of computer Go substantially. In this article we investigate the application of MCTS for the game Lines of Action (L...
Mark H. M. Winands, Yngvi Björnsson, Jahn-Tak...
CCGRID
2005
IEEE
15 years 8 months ago
The Composite Endpoint Protocol (CEP): scalable endpoints for terabit flows
We introduce the Composite Endpoint Protocol (CEP) which efficiently composes a set of transmission elements to support high speed flows which exceed the capabilities of a single...
Eric Weigle, Andrew A. Chien
CONEXT
2008
ACM
15 years 8 months ago
AS alliance: cooperatively improving resilience of intra-alliance communication
The current interdomain routing protocol, BGP, is not resilient to a path failure due to its single-path and slowlyconverging route calculation. This paper proposes a novel approa...
Yuichiro Hei, Akihiro Nakao, Toru Hasegawa, Tomohi...
165
Voted
CSR
2008
Springer
15 years 8 months ago
Comparing Universal Covers in Polynomial Time
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
Jirí Fiala, Daniël Paulusma