246 search results - page 24 / 50 » Dynamic Local Search for the Maximum Clique Problem |
100
click to vote
P2P
2010
IEEE
14 years 8 months ago
2010
IEEE
—In this paper we face the following problem: how to provide each peer local access to the full information (not just a summary) that is distributed over all edges of an overlay ...
RTSS
1999
IEEE
15 years 1 months ago
1999
IEEE
The problem of maximizing system utility by allocating a single finite resource to satisfy discrete Quality of Service (QoS) requirements of multiple applications along multiple Q...
126
click to vote
SIAMIS
2010
14 years 4 months ago
2010
Markov random field (MRF) models, including conditional random field models, are popular in computer vision. However, in order to be computationally tractable, they are limited to ...
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
This paper presents a hybrid evolutionary programming algorithm to solve the spread spectrum radar polyphase code design problem. The proposed algorithm uses an Evolutionary Progr...
121
click to vote
TEC
2010
14 years 4 months ago
2010
In the real world, many optimization problems are dynamic. This requires an optimization algorithm to not only find the global optimal solution under a specific environment but als...