3206 search results - page 196 / 642 » Optimizing Graph Algorithms for Improved Cache Performance |
107
click to vote
AAAI
1998
15 years 4 months ago
1998
We describe a general approach to optimization which we term Squeaky Wheel" Optimization SWO. In SWO, a greedy algorithm is used to construct a solution which is then analyze...
121
Voted
JAIR
2000
15 years 3 months ago
2000
This paper reviews the connections between Graphplan's planning-graph and the dynamic constraint satisfaction problem and motivates the need for adapting CSP search technique...
133
Voted
ICCD
2001
IEEE
16 years 11 days ago
2001
IEEE
This paper deals with low-energy code generation for a highly optimized digital signal processor designed for mobile communication applications. We present a genetic algorithm bas...
119
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
131
click to vote
APPROX
1998
Springer
15 years 7 months ago
1998
Springer
We present randomized approximation algorithms for the circular arc graph colouring problem and for the problem of bandwidth allocation in all-optical ring networks. We obtain a fa...