Sciweavers

1662 search results - page 258 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
DCC
2003
IEEE
14 years 8 months ago
Optimal Alphabet Partitioning for Semi-Adaptive Coding of Sources of Unknown Sparse Distributions
Practical applications that employ entropy coding for large alphabets often partition the alphabet set into two or more layers and encode each symbol by using some suitable prefix...
Dan Chen, Yi-Jen Chiang, Nasir D. Memon, Xiaolin W...
SASO
2009
IEEE
14 years 3 months ago
Evolution of Probabilistic Consensus in Digital Organisms
—The complexity of distributed computing systems and their increasing interaction with the physical world impose challenging requirements in terms of adaptation, robustness, and ...
David B. Knoester, Philip K. McKinley
SAC
2000
ACM
14 years 1 months ago
WCML: Paving the Way for Reuse in Object-Oriented Web Engineering
Since 1990 the Web has changed from a distributed hypertext system to an efficient environment for application delivery. Due to the legacy of the Web implementation model the deve...
Martin Gaedke, Christian Segor, Hans-Werner Geller...
ANCS
2007
ACM
14 years 23 days ago
Optimal packet scheduling in output-buffered optical switches with limited-range wavelength conversion
All-optical packet switching is a promising candidate for future high-speed switching. However, due to the absence of optical Random Access Memory, the traditional Virtual Output ...
Lin Liu, Yuanyuan Yang
E2EMON
2006
IEEE
14 years 13 days ago
Object-Relational DBMS for Packet-Level Traffic Analysis: Case Study on Performance Optimization
Analyzing Internet traffic at packet level involves generally large amounts of raw data, derived data, and results from various analysis tasks. In addition, the analysis often proc...
Matti Siekkinen, Ernst W. Biersack, Vera Goebel