Sciweavers

4313 search results - page 63 / 863
» Using time travel to diagnose computer problems
Sort
View
SODA
2012
ACM
229views Algorithms» more  SODA 2012»
13 years 6 months ago
Approximation algorithms for stochastic orienteering
In the Stochastic Orienteering problem, we are given a metric, where each node also has a job located there with some deterministic reward and a random size. (Think of the jobs as...
Anupam Gupta, Ravishankar Krishnaswamy, Viswanath ...
EOR
2006
65views more  EOR 2006»
15 years 4 months ago
Dynamic programming and minimum risk paths
: This paper addresses the problem of computing minimum risk paths by taking as objective the expected accident cost. The computation is based on a dynamic programming formulation ...
Paolo Serafini
USITS
2003
15 years 5 months ago
Why Do Internet Services Fail, and What Can Be Done About It?
In 1986 Jim Gray published his landmark study of the causes of failures of Tandem systems and the techniques Tandem used to prevent such failures [6]. Seventeen years later, Inter...
David L. Oppenheimer, Archana Ganapathi, David A. ...
MOBISYS
2006
ACM
16 years 3 months ago
MOJO: a distributed physical layer anomaly detection system for 802.11 WLANs
Deployments of wireless LANs consisting of hundreds of 802.11 access points with a large number of users have been reported in enterprises as well as college campuses. However, du...
Anmol Sheth, Christian Doerr, Dirk Grunwald, Richa...
CEC
2010
IEEE
15 years 5 months ago
Population-Based Guided Local Search: Some preliminary experimental results
Based on the Proximate Optimality Principle in metaheuristics, a Population Based Guided Local Search (PGLS) framework for dealing with difficult combinatorial optimization problem...
Nasser Tairan, Qingfu Zhang