1963 search results - page 291 / 393 » The Maximum Solution Problem on Graphs |
94
Voted
TSMC
2002
15 years 7 days ago
2002
Abstract--The notion of the necessary criticality (both with respect to path and to activity) of a network with imprecisely defined (by means of intervals or fuzzy intervals) activ...
129
Voted
JSAT
2010
14 years 7 months ago
2010
In this paper we analyze three well-known preprocessors for Max-SAT. The first preprocessor is based on the so-called variable saturation. The second preprocessor is based on the ...
132
click to vote
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
A discretized version of a continuous optimization problem is considered for the case where data is obtained from a set of dispersed sensor nodes and the overall metric is a sum o...
INFOCOM
2009
IEEE
15 years 7 months ago
2009
IEEE
— In this paper, we study sensor enabled landmine networks by formulating a minimum-cost mine selection problem. The problem arises in a target defence scenario, where the object...
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
The Cross Entropy algorithm is a new search method for combinatorial problem. However, it needs considerable computational time to achieve good solution quality. To make the Cross...