271 search results - page 5 / 55 » A Comparative Study Of Algorithms For Land Cover Change |
IICAI
2003
13 years 9 months ago
2003
Minimum vertex cover problem (MVCP) is an NP-hard problem and it has numerous real life applications. This paper presents hybrid genetic algorithm (HGA) to solve MVCP efficiently. ...
SBBD
2008
13 years 9 months ago
2008
Abstract Data mining algorithms have been recently applied to software repositories to help on the maintenance of evolving software systems. In the past, information about what cla...
AMFG
2003
IEEE
14 years 28 days ago
2003
IEEE
Techniques for face recognition generally fall into global and local approaches, with the principal component analysis (PCA) being the most prominent global approach. This paper u...
ADMA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Crawling the deep web often requires the selection of an appropriate set of queries so that they can cover most of the documents in the data source with low cost. This ca...
FSTTCS
2009
Springer
14 years 2 months ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...