54 search results - page 9 / 11 » On domination and reinforcement numbers in trees |
CEC
2011
IEEE
12 years 8 months ago
2011
IEEE
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
TSMC
2002
13 years 8 months ago
2002
Abstract--This paper proposes a new algorithm for the reduction of the number of colors in an image. The proposed adaptive color reduction (ACR) technique achieves color reduction ...
WWW
2010
ACM
14 years 3 months ago
2010
ACM
Clustering and retrieval of web pages dominantly relies on analyzing either the content of individual web pages or the link structure between them. Some literature also suggests t...
DAM
1999
13 years 8 months ago
1999
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
NIPS
1996
13 years 9 months ago
1996
Predictions oflifetimesofdynamicallyallocated objects can be used to improve time and space e ciency of dynamic memory management in computer programs. Barrett and Zorn 1993] used...