Sciweavers

17366 search results - page 172 / 3474
» New Revision Algorithms
Sort
View
CN
2007
92views more  CN 2007»
15 years 4 months ago
A new approach to dynamic bandwidth allocation in Quality of Service networks: Performance and bounds
Efficient dynamic resource provisioning algorithms are necessary to the development and automation of Quality of Service (QoS) networks. The main goal of these algorithms is to oļ...
Jocelyne Elias, Fabio Martignon, Antonio Capone, G...
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
15 years 9 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
BMCBI
2006
155views more  BMCBI 2006»
15 years 4 months ago
CAVER: a new tool to explore routes from protein clefts, pockets and cavities
Background: The main aim of this study was to develop and implement an algorithm for the rapid, accurate and automated identification of paths leading from buried protein clefts, ...
Martin Petrek, Michal Otyepka, Pavel Banás,...
TSP
2008
79views more  TSP 2008»
15 years 4 months ago
New Blind Block Synchronization for Transceivers Using Redundant Precoders
This paper studies the blind block synchronization problem in block transmission systems using linear redundant precoders (LRP). Two commonly used LRP systems, namely, zero padding...
Borching Su, P. P. Vaidyanathan
APPROX
2011
Springer
242views Algorithms» more  APPROX 2011»
14 years 4 months ago
New Tools for Graph Coloring
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
Sanjeev Arora, Rong Ge