1578 search results - page 248 / 316 » Direct Routing: Algorithms and Complexity |
FOSSACS
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. The reachability analysis of recursive programs that communicate asynchronously over reliable Fifo channels calls for restrictions to ensure decidability. We extend here ...
BMEI
2008
IEEE
14 years 4 months ago
2008
IEEE
Multiple sequence alignment is the most fundamental task in bioinformatics and computational biology. In this paper, we present a new algorithm to conduct multiple sequences align...
ICMCS
2008
IEEE
14 years 4 months ago
2008
IEEE
We present an implementation of general FFTs for graphics processing units (GPUs). Unlike most existing GPU FFT implementations, we handle both complex and real data of any size t...
IROS
2008
IEEE
14 years 4 months ago
2008
IEEE
Abstract— Kinodynamic planning algorithms have the potential to find feasible control trajectories which accomplish a task even in very nonlinear or constrained dynamical system...
BIBE
2007
IEEE
14 years 4 months ago
2007
IEEE
Network mapping is a convenient tool for comparing and exploring biological networks; it can be used for predicting unknown pathways, fast and meaningful searching of databases, a...