Sciweavers

672 search results - page 24 / 135
» Almost Optimal Dispersers
Sort
View
OL
2011
190views Neural Networks» more  OL 2011»
13 years 4 months ago
On optimality of a polynomial algorithm for random linear multidimensional assignment problem
We demonstrate that the Linear Multidimensional Assignment Problem with iid random costs is polynomially "-approximable almost surely (a. s.) via a simple greedy heuristic, f...
Pavlo A. Krokhmal
ALGORITHMICA
2008
78views more  ALGORITHMICA 2008»
13 years 10 months ago
Optimally Adaptive Integration of Univariate Lipschitz Functions
We consider the problem of approximately integrating a Lipschitz function f (with a known Lipschitz constant) over an interval. The goal is to achieve an error of at most using as...
Ilya Baran, Erik D. Demaine, Dmitriy A. Katz
PPOPP
2006
ACM
14 years 3 months ago
Optimizing irregular shared-memory applications for distributed-memory systems
In prior work, we have proposed techniques to extend the ease of shared-memory parallel programming to distributed-memory platforms by automatic translation of OpenMP programs to ...
Ayon Basumallik, Rudolf Eigenmann
CEC
2010
IEEE
13 years 10 months ago
The differential Ant-Stigmergy Algorithm for large-scale global optimization
— Ant-colony optimization (ACO) is a popular swarm intelligence metaheuristic scheme that can be applied to almost any optimization problem. In this paper, we address a performan...
Peter Korosec, Katerina Taskova, Jurij Silc
LSSC
2005
Springer
14 years 3 months ago
Ant Algorithm for Grid Scheduling Problem
Abstract. Grid computing is a form of distributed computing that involves coordinating and sharing computing, application, data storage or network resources across dynamic and geog...
Stefka Fidanova, Mariya K. Durchova