Sciweavers

3136 search results - page 263 / 628
» Comparison of Clique-Listing Algorithms
Sort
View
ALGORITHMICA
2004
111views more  ALGORITHMICA 2004»
15 years 6 months ago
Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems
We present a framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is two-fold--rapid development and improved up...
Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Nie...
IPPS
1998
IEEE
15 years 10 months ago
A Comparative Study of Five Parallel Genetic Algorithms Using the Traveling Salesman Problem
Parallel genetic algorithms (PGAs) have been developed to reduce the large execution times that are associated with serial genetic algorithms (SGAs). They have also been used to s...
Lee Wang, Anthony A. Maciejewski, Howard Jay Siege...
LREC
2008
154views Education» more  LREC 2008»
15 years 8 months ago
A Comparative Evaluation of Term Recognition Algorithms
Automatic Term recognition (ATR) is a fundamental processing step preceding more complex tasks such as semantic search and ontology learning. From a large number of methodologies ...
Ziqi Zhang, José Iria, Christopher Brewster...
GECCO
2008
Springer
117views Optimization» more  GECCO 2008»
15 years 7 months ago
Is "best-so-far" a good algorithmic performance metric?
In evolutionary computation, experimental results are commonly analyzed using an algorithmic performance metric called best-so-far. While best-so-far can be a useful metric, its u...
Nathaniel P. Troutman, Brent E. Eskridge, Dean F. ...
APIN
2007
118views more  APIN 2007»
15 years 6 months ago
Using genetic algorithms to reorganize superpeer structure in peer to peer networks
In this thesis, we describe a genetic algorithm for optimizing the superpeer structure of semantic peer to peer networks. Peer to peer, also called P2P, networks enable us to sear...
Jaymin Kessler, Khaled Rasheed, Ismailcem Budak Ar...