Sciweavers

1090 search results - page 84 / 218
» Priority Algorithms for Graph Optimization Problems
Sort
View
FOCS
2008
IEEE
14 years 4 months ago
Constant-Time Approximation Algorithms via Local Improvements
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
Huy N. Nguyen, Krzysztof Onak
CSCLP
2008
Springer
13 years 12 months ago
IDB-ADOPT: A Depth-First Search DCOP Algorithm
Abstract. Many agent coordination problems can be modeled as distributed constraint optimization problems (DCOPs). ADOPT is an asynchronous and distributed search algorithm that is...
William Yeoh, Ariel Felner, Sven Koenig
GECCO
2007
Springer
186views Optimization» more  GECCO 2007»
14 years 4 months ago
A multi-objective approach for the prediction of loan defaults
Credit institutions are seldom faced with problems dealing with single objectives. Often, decisions involving optimizing two or more competing goals simultaneously need to be made...
Oluwarotimi Odeh, Praveen Koduru, Sanjoy Das, Alle...
STOC
1994
ACM
125views Algorithms» more  STOC 1994»
14 years 2 months ago
A spectral technique for coloring random 3-colorable graphs (preliminary version)
Let G(3n, p, 3) be a random 3-colorable graph on a set of 3n vertices generated as follows. First, split the vertices arbitrarily into three equal color classes and then choose ev...
Noga Alon, Nabil Kahale
JCP
2008
135views more  JCP 2008»
13 years 10 months ago
Hybrid Evolutionary Algorithm Based Solution for Register Allocation for Embedded Systems
Embedded systems have an ever-increasing need for optimizing compilers to produce high quality codes with a limited general purpose register set. Either memory or registers are use...
Anjali Mahajan, M. S. Ali