Sciweavers

1161 search results - page 48 / 233
» Approximation schemes for clustering problems
Sort
View
66
Voted
JIRS
2006
87views more  JIRS 2006»
14 years 9 months ago
A Comparison of Fuzzy and CPWL Approximations in the Continuous-time Nonlinear Model-predictive Control of Time-delayed Wiener-t
This paper deals with a novel method of continuous-time model-predictive control for nonlinear time-delayed systems. The problems relating to time delays are solved by incorporatin...
Simon Oblak, Igor Skrjanc
CLUSTER
2001
IEEE
15 years 1 months ago
Approximation Algorithms for Data Distribution with Load Balancing of Web Servers
Given the increasing traffic on the World Wide Web (Web), it is difficult for a single popular Web server to handle the demand from its many clients. By clustering a group of Web ...
Li-Chuan Chen, Hyeong-Ah Choi
65
Voted
ACSAC
2001
IEEE
15 years 1 months ago
Mining Alarm Clusters to Improve Alarm Handling Efficiency
It is a well-known problem that intrusion detection systems overload their human operators by triggering thousands of alarms per day. As a matter of fact, we have been asked by on...
Klaus Julisch
ICNP
2009
IEEE
15 years 4 months ago
Attack-Tolerant Distributed Sensing for Dynamic Spectrum Access Networks
—Accurate sensing of the spectrum condition is of crucial importance to the mitigation of the spectrum scarcity problem in dynamic spectrum access (DSA) networks. Specifically, ...
Alexander W. Min, Kang G. Shin, Xin Hu
IPPS
2003
IEEE
15 years 3 months ago
Using Golomb Rulers for Optimal Recovery Schemes in Fault Tolerant Distributed Computing
Clusters and distributed systems offer fault tolerance and high performance through load sharing. When all computers are up and running, we would like the load to be evenly distrib...
Kamilla Klonowska, Lars Lundberg, Håkan Lenn...