Sciweavers

613 search results - page 53 / 123
» Time Optimal Self-Stabilizing Spanning Tree Algorithms
Sort
View
FPGA
2003
ACM
117views FPGA» more  FPGA 2003»
15 years 2 months ago
PipeRoute: a pipelining-aware router for FPGAs
We present a pipelining-aware router for FPGAs. The problem of routing pipelined signals is different from the conventional FPGA routing problem. For example, the two terminal N-D...
Akshay Sharma, Carl Ebeling, Scott Hauck
CSB
2004
IEEE
109views Bioinformatics» more  CSB 2004»
15 years 1 months ago
Rec-I-DCM3: A Fast Algorithmic Technique for Reconstructing Large Phylogenetic Trees
Phylogenetic trees are commonly reconstructed based on hard optimization problems such as maximum parsimony (MP) and maximum likelihood (ML). Conventional MP heuristics for produc...
Usman Roshan, Bernard M. E. Moret, Tandy Warnow, T...
ISNN
2004
Springer
15 years 3 months ago
Evolving Flexible Neural Networks Using Ant Programming and PSO Algorithm
A flexible neural network (FNN) is a multilayer feedforward neural network with the characteristics of: (1) overlayer connections; (2) variable activation functions for different...
Yuehui Chen, Bo Yang, Jiwen Dong
CORR
2010
Springer
81views Education» more  CORR 2010»
14 years 9 months ago
Self-stabilization with Byzantine tolerance for global tasks
Self-stabilization is a versatile approach to fault-tolerance since it permits a distributed system to recover from any transient fault that arbitrarily corrupts the contents of a...
Swan Dubois, Toshimitsu Masuzawa, Sébastien...
IWSEC
2010
Springer
14 years 8 months ago
Optimal Adversary Behavior for the Serial Model of Financial Attack Trees
Abstract. Attack tree analysis is used to estimate different parameters of general security threats based on information available for atomic subthreats. We focus on estimating the...
Margus Niitsoo