2485 search results - page 119 / 497 » Time Bounded Frequency Computations |
151
click to vote
ISSRE
2003
IEEE
15 years 10 months ago
2003
IEEE
Testing is often performed frequently during development to ensure software reliability by catching regression errors quickly. However, stopping frequently to test also wastes tim...
179
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
120
Voted
SIGMETRICS
2005
ACM
15 years 10 months ago
2005
ACM
This paper considers the basic problem of “how accurate can we make Internet performance measurements”. The answer is somewhat counter-intuitive in that there are bounds on th...
138
click to vote
FOCS
2006
IEEE
15 years 11 months ago
2006
IEEE
In this work we study a wide range of online and offline routing and packing problems with various objectives. We provide a unified approach, based on a clean primal-dual method...
122
click to vote
P2P
2007
IEEE
15 years 11 months ago
2007
IEEE
Current P2P systems employ tit-for-tat strategies, where peers only upload when they are simultaneously downloading, to avoid free riding. We derive optimal tit-for-tat strategies...