5169 search results - page 157 / 1034 » Locality approximation using time |
125
Voted
DASFAA
2006
IEEE
15 years 11 months ago
2006
IEEE
Abstract. As networks continue to grow in size and complexity, distributed network monitoring and resource querying are becoming increasingly difficult. Our aim is to design, build...
172
click to vote
SAT
2010
Springer
15 years 3 months ago
2010
Springer
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
116
click to vote
STOC
2002
ACM
16 years 5 months ago
2002
ACM
In this paper, we show that for several clustering problems one can extract a small set of points, so that using those core-sets enable us to perform approximate clustering effici...
128
click to vote
MANSCI
2008
15 years 4 months ago
2008
Continuing research by Jennings, Mandelbaum, Massey and Whitt (1996), we investigate methods to perform time-dependent staffing for many-server queues. Our aim is to achieve time-...
152
click to vote
SAC
2008
ACM
15 years 4 months ago
2008
ACM
For short-term forecasting of wind generation, a necessary step is to model the function for the conversion of meteorological variables (mainly wind speed) to power production. Su...