138 search results - page 20 / 28 » Finding an optimal tree searching strategy in linear time |
120
click to vote
ANOR
2011
14 years 5 months ago
2011
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
IEICET
2006
15 years 1 months ago
2006
A problem of arranging n points as uniformly as possible, which is equivalent to that of packing n equal and non-overlapping circles in a unit square, is frequently asked. In this ...
128
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
ROBIO
2006
IEEE
15 years 7 months ago
2006
IEEE
– This paper presents an ongoing investigation to select optimal subset of features from set of well-known myoelectric signals (MES) features in time and frequency domains. Four ...
GI
2007
Springer
15 years 8 months ago
2007
Springer
: This paper deals with the linear discrete-time sensor scheduling problem in unreliable communication networks. In case of the common assumption of an errorfree communication, the...