501 search results - page 34 / 101 » Rough Sets and Approximation Schemes |
SSS
2009
Springer
14 years 2 months ago
2009
Springer
We propose a communication scheme for GALS systems with independent but approximately synchronized clock sources, which guarantees high-speed metastability-free communication betwe...
CEC
2005
IEEE
14 years 3 months ago
2005
IEEE
AbstractInteractive evolutionary algorithms (IEA) often suffer from what is called the “user bottleneck.” In this paper, we propose and analyse a method to limit the user inter...
ICALP
2001
Springer
14 years 2 months ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
SSS
2009
Springer
14 years 4 months ago
2009
Springer
We consider setting up sleep scheduling in sensor networks. We formulate the problem as an instance of the fractional domatic partition problem and obtain a distributed approximati...
GM
1999
Springer
14 years 2 months ago
1999
Springer
In many applications one is concerned with the approximation of functions from a finite set of scattered data sites with associated function values. We describe a scheme for cons...