Sciweavers

313 search results - page 62 / 63
» Shortest Paths in Distance-regular Graphs
Sort
View
WIOPT
2010
IEEE
13 years 5 months ago
Hub-betweenness analysis in delay tolerant networks inferred by real traces
—In this paper we study the influence of using hub nodes to relay messages in human-based delay tolerant networks (DTNs), by analyzing empirical traces obtained by human mobilit...
Giuliano Grossi, Federico Pedersini
CPM
1993
Springer
154views Combinatorics» more  CPM 1993»
13 years 11 months ago
On Suboptimal Alignments of Biological Sequences
It is widely accepted that the optimal alignment between a pair of proteins or nucleic acid sequences that minimizes the edit distance may not necessarily re ect the correct biolog...
Dalit Naor, Douglas L. Brutlag
EUROCAST
2007
Springer
159views Hardware» more  EUROCAST 2007»
13 years 11 months ago
Ant Colony Optimization for Model Checking
Abstract Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulas on the program variables. Most of m...
Enrique Alba, J. Francisco Chicano
BMCBI
2008
96views more  BMCBI 2008»
13 years 7 months ago
Novel methodology for construction and pruning of quasi-median networks
Background: Visualising the evolutionary history of a set of sequences is a challenge for molecular phylogenetics. One approach is to use undirected graphs, such as median network...
Sarah C. Ayling, Terence A. Brown
EOR
2008
106views more  EOR 2008»
13 years 7 months ago
Convergent Lagrangian heuristics for nonlinear minimum cost network flows
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...
Torbjörn Larsson, Johan Marklund, Caroline Ol...