4255 search results - page 198 / 851 » Cover |
140
click to vote
INFOCOM
2003
IEEE
15 years 10 months ago
2003
IEEE
Abstract – In this paper, we develop failure-resilient techniques for monitoring link delays and faults in a Service Provider or Enterprise IP network. Our two-phased approach at...
184
click to vote
ESA
2003
Springer
15 years 10 months ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
119
click to vote
ICCBR
2003
Springer
15 years 10 months ago
2003
Springer
In real environments it is often difficult to obtain a collection of cases for the case base that would cover all the problem solving situations. Although it is often somewhat eas...
119
click to vote
GECCO
2009
Springer
15 years 9 months ago
2009
Springer
Typical domains used in machine learning analyses only partially cover the complexity space, remaining a large proportion of problem difficulties that are not tested. Since the ac...
117
click to vote
LCPC
2009
Springer
15 years 9 months ago
2009
Springer
Classic loop unrolling allows to increase the performance of sequential loops by reducing the overheads of the non-computational parts of the loop. Unfortunately, when the loop con...