Sciweavers

1769 search results - page 174 / 354
» Choice in Dynamic Linking
Sort
View
ISMB
1993
15 years 7 months ago
Discovering Sequence Similarity by the Algorithmic Significance Method
The minimal-length encoding approach is applied to define concept of sequence similarity. Asequence is defined to be similar to another sequence or to a set of keywords if it can ...
Aleksandar Milosavljevic
IJCAI
1989
15 years 7 months ago
Time for Action: On the Relation Between Time, Knowledge and Action
We consider the role played by the concept of action in AI. We first briefly summarize the advantages and limitations of past approaches to taking the concept as primitive, as emb...
Yoav Shoham
BELL
2006
71views more  BELL 2006»
15 years 6 months ago
Design tools for transparent optical networks
s span three levels of abstraction, from routing and reconfigurable add/drop multiplexer (ROADM) choice, to span engineering, to power dynamics simulation. Each level represents a ...
Chandra Chekuri, Paul Claisse, René-Jean Es...
JNS
2008
55views more  JNS 2008»
15 years 5 months ago
Interaction of Two Charges in a Uniform Magnetic Field: II. Spatial Problem
The interaction of two charges moving in R3 in a magnetic field B can be formulated as a Hamiltonian system with six degrees of freedom. Assuming that the magnetic field is uniform...
D. Pinheiro, R. S. MacKay
JNW
2006
145views more  JNW 2006»
15 years 5 months ago
A Comparison of Replication Strategies for Reliable Decentralised Storage
Distributed hash tables (DHTs) can be used as the basis of a resilient lookup service in unstable environments: local routing tables are updated to reflected changes in the network...
Matthew Leslie, Jim Davies, Todd Huffman