Sciweavers

153 search results - page 9 / 31
» Solving Demand Versions of Interprocedural Analysis Problems
Sort
View
ICPADS
2007
IEEE
14 years 1 months ago
Parallel Minimum Spanning Tree Heuristic for the steiner problem in graphs
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes...
Hoda Akbari, Zeinab Iranmanesh, Mohammad Ghodsi
SC
2009
ACM
14 years 4 days ago
GPU based sparse grid technique for solving multidimensional options pricing PDEs
It has been shown that the sparse grid combination technique can be a practical tool to solve high dimensional PDEs arising in multidimensional option pricing problems in finance...
Abhijeet Gaikwad, Ioane Muni Toke
GECCO
2009
Springer
119views Optimization» more  GECCO 2009»
14 years 3 days ago
Cooperative micro-differential evolution for high-dimensional problems
High–dimensional optimization problems appear very often in demanding applications. Although evolutionary algorithms constitute a valuable tool for solving such problems, their ...
Konstantinos E. Parsopoulos
MASCOTS
2007
13 years 9 months ago
Multiobjective Analysis in Wireless Mesh Networks
Abstract— Wireless Mesh Networks are a scalable and costeffective solution for next-generation wireless networking. In the present work, we consider the Round Weighting Problem (...
Cristiana Gomes, Gurvan Huiban
GECCO
2006
Springer
173views Optimization» more  GECCO 2006»
13 years 11 months ago
Ant colony optimization technique for equilibrium assignment in congested transportation networks
This paper deals with transport user equilibrium. A modified version of the ant colony system is proposed where the ant colony heuristic is adapted in order to take into account a...
Matteo Matteucci, Lorenzo Mussone