Sciweavers

12289 search results - page 312 / 2458
» computing 2006
Sort
View
172
Voted
TCS
2010
15 years 2 months ago
Computing the graph-based parallel complexity of gene assembly
We consider a graph-theoretical formalization of the process of gene assembly in ciliates introduced in Ehrenfeucht et al (2003), where a gene is modeled as a signed graph. The ge...
Artiom Alhazov, Chang Li, Ion Petre
COR
2008
175views more  COR 2008»
15 years 4 months ago
Lower and upper bounds for a two-level hierarchical location problem in computer networks
In this paper a two-level hierarchical model for the location of concentrators and routers in computers networks is presented. Given a set of candidate locations and the capacitie...
Aníbal Alberto Vilcapoma Ignacio, Virg&iacu...
143
Voted
CSFW
2006
IEEE
15 years 10 months ago
Computationally Sound Compositional Logic for Key Exchange Protocols
We develop a compositional method for proving cryptographically sound security properties of key exchange protocols, based on a symbolic logic that is interpreted over conventiona...
Anupam Datta, Ante Derek, John C. Mitchell, Bogdan...
FCS
2006
15 years 6 months ago
Another Algorithm for Computing Longest Common Increasing Subsequence for Two Random Input Sequences
We have previously developed several algorithms which deal with different input sequence scenarios respectively. In this paper, another sequential algorithm for computing Longest ...
Yongsheng Bai, Bob P. Weems
114
Voted
GECCO
2006
Springer
158views Optimization» more  GECCO 2006»
15 years 8 months ago
Exploring network topology evolution through evolutionary computations
We present an evolutionary methodology that explores the evolution of network topology when a uniform growth of the network traffic is considered. The network redesign problem is ...
Sami J. Habib, Alice C. Parker