8917 search results - page 232 / 1784 » Abstraction in Algorithm Animation |
121
click to vote
EVOW
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We introduce a novel representation for the graph colouring problem, called the Integer Merge Model, which aims to reduce the time complexity of an algorithm. Moreover, o...
155
click to vote
CEC
2005
IEEE
15 years 5 months ago
2005
IEEE
Abstract- Theoretical analysis of the dynamics of evolutionary algorithms is believed to be very important to understand the search behavior of evolutionary algorithms and to devel...
158
click to vote
IPCO
2008
15 years 4 months ago
2008
Abstract. Determining the integrality gap of the bidirected cut relaxation for the metric Steiner tree problem, and exploiting it algorithmically, is a long-standing open problem. ...
106
click to vote
PDPTA
2007
15 years 4 months ago
2007
Abstract In this paper we investigate the composition of cheap network storage resources to meet specific availability and capacity requirements. We show that the problem of find...
158
click to vote
IPCO
2004
15 years 4 months ago
2004
Abstract. We study two-stage, finite-scenario stochastic versions of several combinatorial optimization problems, and provide nearly tight approximation algorithms for them. Our pr...