4926 search results - page 682 / 986 » Two Graph Algorithms On an Associative Computing Model |
AAECC
2007
Springer
14 years 2 months ago
2007
Springer
Let Fn be the binary n-cube, or binary Hamming space of dimension n, endowed with the Hamming distance, and En (respectively, On ) the set of vectors with even (respectively, odd)...
ECOOP
1997
Springer
14 years 16 days ago
1997
Springer
A type inclusion test is a procedure to decide whether two types are related by a given subtyping relationship. An efficient implementation of the type inclusion test plays an impo...
AAAI
2010
13 years 9 months ago
2010
Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. However, df-pn has a notorious problem of infinite loops when applied to domain...
COR
2004
13 years 8 months ago
2004
The multicasting is defined as the distribution of the same information stream from one to many nodes concurrently. There has been an intensive research effort to design protocols...
BMCBI
2008
13 years 8 months ago
2008
Background: Simulating the major molecular events inside an Escherichia coli cell can lead to a very large number of reactions that compose its overall behaviour. Not only should ...