388 search results - page 57 / 78 » A Mixed Closure-CSP Method to Solve Scheduling Problems |
125
click to vote
ICC
2008
IEEE
15 years 6 months ago
2008
IEEE
—It is not possible to ensure that a network is absolutely secure. Therefore, network operators must continually change their defense strategies to counter attackers who constant...
113
click to vote
ICDCS
2010
IEEE
15 years 3 months ago
2010
IEEE
—We propose a steepest descent method to compute optimal control parameters for balancing between multiple performance objectives in stateless stochastic scheduling, wherein the ...
113
click to vote
INFOCOM
2008
IEEE
15 years 6 months ago
2008
IEEE
Cognitive radio (CR) is a revolution in radio technology and is viewed as an enabling technology for dynamic spectrum access. This paper investigates how to design distributed alg...
CP
2006
Springer
15 years 3 months ago
2006
Springer
Many important combinatorial optimization problems can be expressed as constraint satisfaction problems with soft constraints. When problems are too difficult to be solved exactly,...
IAT
2007
IEEE
15 years 6 months ago
2007
IEEE
We present a new hybrid algorithm for local search in distributed combinatorial optimization. This method is a mix between classical local search methods in which nodes take decis...