2107 search results - page 50 / 422 » Computing Small Search Numbers in Linear Time |
ADHOCNOW
2004
Springer
14 years 1 months ago
2004
Springer
Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fun...
DEXA
2010
Springer
13 years 8 months ago
2010
Springer
The class of k Nearest Neighbor (kNN) queries in spatial networks has been widely studied in the literature. All existing approaches for kNN search in spatial networks assume that ...
PRL
2010
13 years 2 months ago
2010
For fast classification under real-time constraints, as required in many imagebased pattern recognition applications, linear discriminant functions are a good choice. Linear discr...
CCGRID
2007
IEEE
13 years 11 months ago
2007
IEEE
We describe a hybrid linear programming (LP) and evolutionary algorithm (EA) based resource matcher suitable for heterogeneous grid environments. The hybrid matcher adopts the ite...
COCOA
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. The search tree size of the spatial Branch-and-Bound algorithm for Mixed-Integer Nonlinear Programming depends on many factors, one of which is the width of the variable ...