2323 search results - page 196 / 465 » Power optimization for connectivity problems |
154
click to vote
ASPDAC
1999
ACM
15 years 10 months ago
1999
ACM
In the past two decades, the simulated annealing technique has been considered as a powerful approach to handle many NP-hard optimization problems in VLSI designs. Recently, a new...
190
click to vote
EPS
1998
Springer
15 years 10 months ago
1998
Springer
This paper reports work investigating various evolutionary approaches to vertex cover (VC), a well-known NP-Hard optimization problem. Central to each of the algorithms is a novel ...
199
click to vote
FUZZIEEE
2007
IEEE
15 years 8 months ago
2007
IEEE
— In many decision support applications it is important to guarantee the expressive power, easy formalization and interpretability of Mamdani-type fuzzy inference systems (FIS), ...
161
click to vote
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper presents the definition as well as a number of methods for the solution of a new combinatorial optimization problem, called S-MAMP that has to be solved for the efficie...
185
click to vote
ICTAI
2010
IEEE
15 years 4 months ago
2010
IEEE
We introduce a new plan repair method for problems cast as Mixed Integer Programs. In order to tackle the inherent complexity of these NP-hard problems, our approach relies on the ...