153 search results - page 9 / 31 » Solving Demand Versions of Interprocedural Analysis Problems |
146
click to vote
ICPADS
2007
IEEE
15 years 9 months ago
2007
IEEE
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...
158
click to vote
SC
2009
ACM
15 years 7 months ago
2009
ACM
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...
125
click to vote
GECCO
2009
Springer
15 years 7 months ago
2009
Springer
High–dimensional optimization problems appear very often in demanding applications. Although evolutionary algorithms constitute a valuable tool for solving such problems, their ...
101
click to vote
MASCOTS
2007
15 years 4 months ago
2007
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 (...
121
click to vote
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
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...