Sciweavers

943 search results - page 104 / 189
» How should data structures and algorithms be taught
Sort
View
SAC
2004
ACM
14 years 2 months ago
Self-maintained distributed tuples for field-based coordination in dynamic networks
Field-based coordination is a very promising approach for a wide range of application scenarios in modern dynamic networks. To implement such an approach, one can rely on distribu...
Marco Mamei, Franco Zambonelli
ICFP
2012
ACM
11 years 11 months ago
Proof-producing synthesis of ML from higher-order logic
The higher-order logic found in proof assistants such as Coq and various HOL systems provides a convenient setting for the development and verification of pure functional program...
Magnus O. Myreen, Scott Owens
TMC
2012
11 years 11 months ago
Message Drop and Scheduling in DTNs: Theory and Practice
Abstract—In order to achieve data delivery in Delay Tolerant Networks (DTN), researchers have proposed the use of store-carryand-forward protocols: a node there may store a messa...
Amir Krifa, Chadi Barakat, Thrasyvoulos Spyropoulo...
BMCBI
2008
124views more  BMCBI 2008»
13 years 9 months ago
A relation based measure of semantic similarity for Gene Ontology annotations
Background: Various measures of semantic similarity of terms in bio-ontologies such as the Gene Ontology (GO) have been used to compare gene products. Such measures of similarity ...
Brendan Sheehan, Aaron J. Quigley, Benoit Gaudin, ...
CIKM
2009
Springer
14 years 3 months ago
Towards non-directional Xpath evaluation in a RDBMS
XML query languages use directional path expressions to locate data in an XML data collection. They are tightly coupled to the structure of a data collection, and can fail when ev...
Sourav S. Bhowmick, Curtis E. Dyreson, Erwin Leona...