Sciweavers

2244 search results - page 58 / 449
» A new heuristic approach for non-convex optimization problem...
Sort
View
FGCS
2000
83views more  FGCS 2000»
15 years 6 months ago
A Graph-based Ant System and its convergence
: A general framework for solving combinatorial optimization problems heuristically by the Ant System approach is developed. The framework is based on the concept of a construction...
Walter J. Gutjahr
CGO
2005
IEEE
15 years 11 months ago
Model-Based Framework: An Approach for Profit-Driven Optimization
Although optimizations have been applied for a number of years to improve the performance of software, problems that have been long-standing remain, which include knowing what opt...
Min Zhao, Bruce R. Childers, Mary Lou Soffa
AAAI
2000
15 years 7 months ago
Extracting Effective and Admissible State Space Heuristics from the Planning Graph
Graphplan and heuristic state space planners such as HSP-R and UNPOP are currently two of the most effective approaches for solving classical planning problems. These approaches h...
XuanLong Nguyen, Subbarao Kambhampati
ISCC
2005
IEEE
143views Communications» more  ISCC 2005»
15 years 11 months ago
Approximating Optimal Multicast Trees in Wireless Multihop Networks
— We study the problem of computing minimal cost multicast trees in multi-hop wireless mesh networks. This problem is known as the Steiner tree problem, and it has been widely st...
Pedro M. Ruiz, Antonio F. Gómez-Skarmeta
CCE
2008
15 years 6 months ago
Chance constrained programming approach to process optimization under uncertainty
Deterministic optimization approaches have been well developed and widely used in the process industry to accomplish off-line and on-line process optimization. The challenging tas...
Pu Li, Harvey Arellano-Garcia, Günter Wozny