1356 search results - page 42 / 272 » Some New Results on Inverse Sorting Problems |
CSC
2008
13 years 9 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
CP
2000
Springer
13 years 12 months ago
2000
Springer
Abstract. This paper evaluates the power of a new scheme that generates search heuristics mechanically. This approach was presented and evaluated rst in the context of optimization...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
—Neighbor discovery is essential for the process of self-organization of a wireless network, where almost all routing and medium access protocols need knowledge of one-hop neighb...
MVA
1992
13 years 8 months ago
1992
We present a new algorithm for topological feature mapping. It is compared to other known feature mapping algorithmslike that proposed by Kohonen or Bertsch. The main difference t...
CSDA
2006
13 years 7 months ago
2006
Several methods to select variables that are subsequently used in discriminant analysis are proposed and analysed. The aim is to find from among a set of m variables a smaller sub...