376 search results - page 30 / 76 » Solution Counting Algorithms for Constraint-Centered Search ... |
DICS
2006
14 years 1 months ago
2006
We address failure location and restoration in both optical and wireless ad hoc networks. First, we show how Maximum Likelihood inference can improve failure location algorithms in...
ICCS
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. This paper describes metaheuristic algorithm based on simulated annealing method,which is a nature-inspired method, to analyze and improve the efficiency of the design of...
LCPC
2005
Springer
14 years 3 months ago
2005
Springer
The goal of this work is a systematic approach to compiler optimization for simultaneously optimizing across multiple levels of the memory hierarchy. Our approach combines compiler...
JCO
1998
13 years 9 months ago
1998
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
JMLR
2006
13 years 10 months ago
2006
An ensemble is a group of learning models that jointly solve a problem. However, the ensembles generated by existing techniques are sometimes unnecessarily large, which can lead t...