1816 search results - page 130 / 364 » A New Approach for Solving the Maximum Clique Problem |
169
click to vote
AIPS
2007
15 years 8 months ago
2007
We introduce the Linear Resource Temporal Network (LRTN), which consists of activities that consume or produce a resource, subject to absolute and relative metric temporal constra...
166
click to vote
ASPDAC
1999
ACM
15 years 10 months ago
1999
ACM
In this paper, two faster and better spectral algorithms are presented for the multi-way circuit partitioning problem with the objective of minimizing the Scaled Cost. As pointed ...
150
click to vote
IJCAI
1993
15 years 7 months ago
1993
We introduce a new approach to GA (Genetic Algorithms) based problem solving. Earlier GAs did not contain local search (i.e. hill climbing) mechanisms, which led to optimization d...
152
click to vote
WSC
2001
15 years 7 months ago
2001
The research using artificial intelligence and computer simulation introduces a new approach for solving the job shop-scheduling problem. The new approach is based on the developm...
163
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
The most popular approaches for reconstructing phylogenetic trees attempt to solve NP-hard optimization criteria such as maximum parsimony (MP). Currently, the bestperforming heur...