195 search results - page 18 / 39 » Evolving by Maximizing the Number of Rules: Complexity Study |
EVOW
2011
Springer
14 years 1 months ago
2011
Springer
Abstract. The idea of evolving novel rather than fit solutions has recently been offered as a way to automatically discover the kind of complex solutions that exhibit truly intel...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—In hop-by-hop networks, provision of multipath routes for all nodes can improve fault tolerance and performance. In this paper we study the multipath route calculation by constr...
IJFCS
2008
14 years 9 months ago
2008
In data mining applications, highly sized contexts are handled what usually results in a considerably large set of frequent itemsets, even for high values of the minimum support t...
ICONIP
2007
14 years 11 months ago
2007
Abstract. Principal component analysis (PCA) is a widely used technique for data analysis and dimensionality reduction. Eigenvalue decomposition is the standard algorithm for solvi...