Sciweavers

13376 search results - page 72 / 2676
» Problem Solving with
Sort
View
GECCO
2008
Springer
141views Optimization» more  GECCO 2008»
15 years 3 months ago
Managing team-based problem solving with symbiotic bid-based genetic programming
Bid-based Genetic Programming (GP) provides an elegant mechanism for facilitating cooperative problem decomposition without an a priori specification of the number of team member...
Peter Lichodzijewski, Malcolm I. Heywood
EOR
2008
82views more  EOR 2008»
15 years 2 months ago
Solving the pallet loading problem
This paper presents new bounds, heuristics, and an exact algorithm for the Pallet Loading Problem (PLP). PLP maximizes the number of boxes placed on a rectangular pallet. All boxe...
Gustavo H. A. Martins, Robert F. Dell
DISOPT
2007
94views more  DISOPT 2007»
15 years 2 months ago
Using mixed-integer programming to solve power grid blackout problems
We consider optimization problems related to the prevention of large-scale cascading blackouts in power transmission networks subject to multiple scenarios of externally caused da...
Daniel Bienstock, Sara Mattia
112
Voted
WINE
2005
Springer
135views Economy» more  WINE 2005»
15 years 8 months ago
On Solving Coverage Problems in a Wireless Sensor Network Using Voronoi Diagrams
Owing to numerous potential applications, wireless sensor networks have been the focus of a lot of research efforts lately. In this note we study one fundamental issue in such net...
Anthony Man-Cho So, Yinyu Ye
126
Voted
EUROCAST
2009
Springer
185views Hardware» more  EUROCAST 2009»
15 years 9 months ago
Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
Martin Gruber, Günther R. Raidl