Sciweavers

61 search results - page 2 / 13
» Generic Forward and Backward Simulations
Sort
View
HPCA
1997
IEEE
13 years 9 months ago
Distributed Path Reservation Algorithms for Multiplexed All-Optical Interconnection Networks
ÐIn this paper, we study distributed path reservation protocols for multiplexed all-optical interconnection networks. The path reservation protocols negotiate the reservation and ...
Xin Yuan, Rami G. Melhem, Rajiv Gupta
HPCC
2007
Springer
13 years 11 months ago
A Generic Minimum Dominating Forward Node Set Based Service Discovery Protocol for MANETs
Abstract. Service discovery is a crucial feature for the usability of mobile ad-hoc networks (MANETs). In this paper, Minimum Dominating Forward Node Set based Service Discovery Pr...
Zhen-guo Gao, Sheng Liu, Mei Yang, Jinhua Zhao, Ji...
BMCBI
2008
111views more  BMCBI 2008»
13 years 5 months ago
GENOMEPOP: A program to simulate genomes in populations
Background: There are several situations in population biology research where simulating DNA sequences is useful. Simulation of biological populations under different evolutionary...
Antonio Carvajal-Rodríguez
CMSB
2011
Springer
12 years 5 months ago
Reversible structures
Reversible structures are computational units that may progress forward and backward. We study weak coherent structures that are primarily inspired by dna circuits and may be comp...
Luca Cardelli, Cosimo Laneve
CORR
2010
Springer
91views Education» more  CORR 2010»
13 years 5 months ago
Simulations of Weighted Tree Automata
Simulations of weighted tree automata (wta) are considered. It is shown how such simulations can be decomposed into simpler functional and dual functional simulations also called f...
Zoltán Ésik, Andreas Maletti