Sciweavers

697 search results - page 92 / 140
» A Study of Evaluation Functions for the Graph K-Coloring Pro...
Sort
View
AI
2011
Springer
13 years 2 months ago
Bounded approximate decentralised coordination via the max-sum algorithm
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
Alex Rogers, Alessandro Farinelli, Ruben Stranders...
APPROX
2006
Springer
120views Algorithms» more  APPROX 2006»
13 years 11 months ago
Single-Source Stochastic Routing
Abstract. We introduce and study the following model for routing uncertain demands through a network. We are given a capacitated multicommodity flow network with a single source an...
Shuchi Chawla, Tim Roughgarden
EMO
2005
Springer
194views Optimization» more  EMO 2005»
14 years 1 months ago
An EMO Algorithm Using the Hypervolume Measure as Selection Criterion
Abstract. The hypervolume measure is one of the most frequently applied measures for comparing the results of evolutionary multiobjective optimization algorithms (EMOA). The idea t...
Michael Emmerich, Nicola Beume, Boris Naujoks
EOR
2007
68views more  EOR 2007»
13 years 7 months ago
Multiattribute electronic procurement using goal programming
One of the key challenges of current day electronic procurement systems is to enable procurement decisions transcend beyond a single attribute such as cost. Consequently, multiatt...
S. Kameshwaran, Y. Narahari, Charles H. Rosa, Deva...
SIGSOFT
2008
ACM
14 years 8 months ago
Why do developers neglect exception handling?
In this paper, we explore the problems associated with exception handling from a new dimension: the human. We designed a study that evaluates (1) different perspectives of softwar...
Carsten Görg, Hina Shah, Mary Jean Harrold