4313 search results - page 134 / 863 » Using time travel to diagnose computer problems |
155
click to vote
NIPS
2004
15 years 6 months ago
2004
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...
128
click to vote
HEURISTICS
2007
15 years 4 months ago
2007
Abstract. The Maximum Diversity Problem (MDP) consists in identifying, in a population, a subset of elements, characterized by a set of attributes, that present the most diverse ch...
114
Voted
TRANSCI
2011
14 years 11 months ago
2011
This paper presents a dynamic (or multi-period) hub location problem. It proposes a branch-and-bound algorithm that uses a Lagrangean relaxation to obtain lower and upper bounds a...
137
Voted
AAAI
2007
15 years 7 months ago
2007
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
138
click to vote
JGS
2006
15 years 4 months ago
2006
In practical applications of area-to-point spatial interpolation, inequality constraints, such as non-negativity, or more general constraints on the maximum and/or minimum allowab...