Sciweavers

1429 search results - page 225 / 286
» The Complexity of the Approximation of the Bandwidth Problem
Sort
View
ALGORITHMICA
2000
161views more  ALGORITHMICA 2000»
13 years 7 months ago
Binary Searching with Nonuniform Costs and Its Application to Text Retrieval
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
Gonzalo Navarro, Ricardo A. Baeza-Yates, Eduardo F...
ICC
2007
IEEE
125views Communications» more  ICC 2007»
14 years 2 months ago
A Two-Layer Characteristic-based Rate Control Framework for Low Delay Video Transmission
— In this paper, we present a two-layer rate control In [4], their rate controller TMN8 applied the Lagrange framework for low delay video transmission based on a multiplier to d...
Chun-Yuan Chang, Ming-Hung Chen, Cheng-Fu Chou, Di...
ATAL
2006
Springer
13 years 11 months ago
Gradient field-based task assignment in an AGV transportation system
Assigning tasks to agents is complex, especially in highly dynamic environments. Typical protocol-based approaches for task assignment such as Contract Net have proven their value...
Danny Weyns, Nelis Boucké, Tom Holvoet
INTEGRATION
2008
183views more  INTEGRATION 2008»
13 years 7 months ago
Network-on-Chip design and synthesis outlook
With the growing complexity in consumer embedded products, new tendencies forecast heterogeneous Multi-Processor SystemsOn-Chip (MPSoCs) consisting of complex integrated component...
David Atienza, Federico Angiolini, Srinivasan Mura...
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
14 years 1 months ago
Highly Scalable and Accurate Seeds for Subsequence Alignment
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
Abhijit Pol, Tamer Kahveci