Sciweavers

763 search results - page 133 / 153
» Engineering Shortest Path Algorithms
Sort
View
STACS
2007
Springer
14 years 1 months ago
Wavelength Management in WDM Rings to Maximize the Number of Connections
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
Ioannis Caragiannis
BMCBI
2008
128views more  BMCBI 2008»
13 years 7 months ago
Efficient computation of absent words in genomic sequences
Background: Analysis of sequence composition is a routine task in genome research. Organisms are characterized by their base composition, dinucleotide relative abundance, codon us...
Julia Herold, Stefan Kurtz, Robert Giegerich
SIGSOFT
2008
ACM
14 years 8 months ago
Marple: a demand-driven path-sensitive buffer overflow detector
Despite increasing efforts in detecting and managing software security vulnerabilities, the number of security attacks is still rising every year. As software becomes more complex...
Wei Le, Mary Lou Soffa
CORR
2010
Springer
94views Education» more  CORR 2010»
13 years 7 months ago
Real-Time Multi-path Tracking of Probabilistic Available Bandwidth
Applications such as traffic engineering and network provisioning can greatly benefit from knowing, in real time, what is the largest input rate at which it is possible to transmit...
Frederic Thouin, Mark Coates, Michael Rabbat
CODES
2003
IEEE
14 years 28 days ago
Synthesis of real-time embedded software with local and global deadlines
Current methods cannot synthesize real-time embedded software applications when the global deadline of a task is shorter than the total of all local deadlines along a critical pat...
Pao-Ann Hsiung, Cheng-Yi Lin