Sciweavers

63 search results - page 11 / 13
» Improved bounds for dictionary look-up with one error
Sort
View
MINENET
2005
ACM
14 years 1 months ago
Shrink: a tool for failure diagnosis in IP networks
Faults in an IP network have various causes such as the failure of one or more routers at the IP layer, fiber-cuts, failure of physical elements at the optical layer, or extraneo...
Srikanth Kandula, Dina Katabi, Jean-Philippe Vasse...
GRAPHICSINTERFACE
2007
13 years 9 months ago
Surface distance maps
We present an interactive algorithm to compute surface distance maps for triangulated models. The distance map represents the distance-to-closest-primitive mapping at each point o...
Avneesh Sud, Naga K. Govindaraju, Russell Gayle, E...
AAAI
2008
13 years 9 months ago
How Good is Almost Perfect?
Heuristic search using algorithms such as A and IDA is the prevalent method for obtaining optimal sequential solutions for classical planning tasks. Theoretical analyses of these ...
Malte Helmert, Gabriele Röger
ICALP
2009
Springer
14 years 7 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
MP
2002
176views more  MP 2002»
13 years 7 months ago
UOBYQA: unconstrained optimization by quadratic approximation
UOBYQA is a new algorithm for general unconstrained optimization calculations, that takes account of the curvature of the objective function, F say, by forming quadratic models by ...
M. J. D. Powell