Sciweavers

4355 search results - page 639 / 871
» Increasing Kolmogorov Complexity
Sort
View
ETT
2000
85views Education» more  ETT 2000»
15 years 6 months ago
Simple On-Line Scheduling Algorithms for All-Optical Broadcast-and-Select Networks
This paper considers all-optical broadcast networks providing a number of slotted WDM channels for packet communications. Each network user is equipped with one tunable transmitter...
Marco Ajmone Marsan, Andrea Bianco, Emilio Leonard...
IWC
2000
81views more  IWC 2000»
15 years 6 months ago
Steps to take before intelligent user interfaces become real
Intelligent user interfaces have been proposed as a means to overcome some of the problems that directmanipulation interfaces cannot handle, such as: information overflow problems...
Kristina Höök
SIAMJO
2000
101views more  SIAMJO 2000»
15 years 6 months ago
An Efficient Algorithm for Minimizing a Sum of p-Norms
We study the problem of minimizing a sum of p-norms where p is a fixed real number in the interval [1, ]. Several practical algorithms have been proposed to solve this problem. How...
Guoliang Xue, Yinyu Ye
SIGMETRICS
2000
ACM
111views Hardware» more  SIGMETRICS 2000»
15 years 6 months ago
AMVA techniques for high service time variability
Motivated by experience gained during the validation of a recent Approximate Mean Value Analysis (AMVA) model of modern shared memory architectures, this paper re-examines the &qu...
Derek L. Eager, Daniel J. Sorin, Mary K. Vernon
CGF
1998
127views more  CGF 1998»
15 years 6 months ago
Getting Rid of Links in Hierarchical Radiosity
Hierarchical radiosity with clustering has positioned itself as one of the most efficient algorithms for computing global illumination in non-trivial environments. However, using...
Marc Stamminger, Hartmut Schirmacher, Philipp Slus...