1816 search results - page 149 / 364 » A New Approach for Solving the Maximum Clique Problem |
202
click to vote
MICRO
2002
IEEE
15 years 11 months ago
2002
IEEE
Pre-execution attacks cache misses for which conventional address-prediction driven prefetching is ineffective. In pre-execution, copies of cache miss computations are isolated fr...
177
click to vote
INFOCOM
2008
IEEE
16 years 27 days ago
2008
IEEE
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
253
click to vote
EGC
2009
Springer
15 years 4 months ago
2009
Springer
We present a new evaluation criterion for the induction of decision trees. We exploit a parameter-free Bayesian approach and propose an analytic formula for the evaluation of the p...
150
click to vote
TON
2002
15 years 6 months ago
2002
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...
181
click to vote
HEURISTICS
2008
15 years 6 months ago
2008
In this article we investigate a new variant of Variable Neighborhood Search (VNS): Relaxation Guided Variable Neighborhood Search. It is based on the general VNS scheme and a new...