5214 search results - page 142 / 1043 » The Online Specialization Problem |
260
click to vote
ICDE
2005
IEEE
16 years 5 months ago
2005
IEEE
We introduce a network-based problem detection framework for distributed systems, which includes a data-mining method for discovering dynamic dependencies among distributed servic...
153
Voted
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
Surprisingly, console logs rarely help operators detect problems in large-scale datacenter services, for they often consist of the voluminous intermixing of messages from many sof...
176
Voted
ESA
2003
Springer
15 years 9 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 ...
144
Voted
CRYPTO
2008
Springer
15 years 5 months ago
2008
Springer
We construct noninteractive statistical zero-knowledge (NISZK) proof systems for a variety of standard approximation problems on lattices, such as the shortest independent vectors...
103
click to vote
ANOR
2007
15 years 4 months ago
2007
The min-SHIFT DESIGN problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the...