Sciweavers

2157 search results - page 370 / 432
» Binary ant algorithm
Sort
View
WCC
2005
Springer
130views Cryptology» more  WCC 2005»
15 years 5 months ago
On the Design of Codes for DNA Computing
In this paper, we describe a broad class of problems arising in the context of designing codes for DNA computing. We primarily focus on design considerations pertaining to the phen...
Olgica Milenkovic, Navin Kashyap
APLAS
2004
ACM
15 years 5 months ago
Translation of Tree-Processing Programs into Stream-Processing Programs Based on Ordered Linear Type
There are two ways to write a program for manipulating tree-structured data such as XML documents: One is to write a tree-processing program focusing on the logical structure of t...
Koichi Kodama, Kohei Suenaga, Naoki Kobayashi
ASPDAC
2004
ACM
107views Hardware» more  ASPDAC 2004»
15 years 5 months ago
Minimization of the expected path length in BDDs based on local changes
— In many verification tools methods for functional simulation based on reduced ordered Binary Decision Diagrams (BDDs) are used. The evaluation time for a BDD can be crucial an...
Rüdiger Ebendt, Wolfgang Günther, Rolf D...
SIGCSE
2004
ACM
188views Education» more  SIGCSE 2004»
15 years 5 months ago
Buffer pools and file processing projects for an undergraduate data structures course
This paper presents a family of programming projects appropriate to a sophomore-level data structures course, centered around the concept of a buffer pool serving as the access i...
Clifford A. Shaffer
ARCS
2004
Springer
15 years 5 months ago
Heterogenous Data Fusion via a Probabilistic Latent-Variable Model
In a pervasive computing environment, one is facing the problem of handling heterogeneous data from different sources, transmitted over heterogeneous channels and presented on het...
Kai Yu, Volker Tresp