2006 search results - page 54 / 402 » Heuristic Security-Testing Methods |
ADG
2000
Springer
15 years 3 months ago
2000
Springer
In this paper we propose a bracket algebra based elimination method for automated generation of readable proofs for theorems in incidence geometry. This method is based on two tech...
ALGORITHMICA
2005
14 years 11 months ago
2005
We present polynomial upper and lower bounds on the number of iterations performed by the k-means method (a.k.a. Lloyd's method) for k-means clustering. Our upper bounds are ...
70
Voted
ICRA
1999
IEEE
15 years 3 months ago
1999
IEEE
This paper introduces a novel heuristic nmdmap method for path planning, one that is inspired by the Vomnoi diagmm concept, but easiZy applicable to geneml configurntion spaces. T...
FLAIRS
2006
15 years 12 days ago
2006
A conditioning graph is a form of recursive factorization which minimizes the memory requirements and simplifies the implementation of inference in Bayesian networks. The time com...
102
click to vote
ECAL
2007
Springer
15 years 5 months ago
2007
Springer
We examine the practical problem of a mobile autonomous robot performing a long-duration survey task, during which it must recharge its batteries periodically. We present a scalabl...