1816 search results - page 294 / 364 » A New Approach for Solving the Maximum Clique Problem |
169
click to vote
ISVLSI
2002
IEEE
15 years 11 months ago
2002
IEEE
Retiming has been shown to be a powerful technique for improving the performance of synchronous circuits. However, even though retiming algorithms of polynomial time complexity ha...
152
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique ap...
144
click to vote
ILP
1998
Springer
15 years 10 months ago
1998
Springer
This paper describes a new kind of language bias, S-structural indeterminate clauses, which takes into account the meaning of predicates that play a key role in the complexity of l...
254
click to vote
SEAAI
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. In the past, some information technologies (IT) have quickly been adopted by the engineering practice while the implementation of others has been slower. In the paper, th...
154
click to vote
EMO
2006
Springer
15 years 10 months ago
2006
Springer
In this paper we study a number of issues related to the design of a cellular genetic algorithm (cGA) for multiobjective optimization. We take as an starting point an algorithm fol...