Sciweavers

850 search results - page 32 / 170
» heuristics 2006
Sort
View
HEURISTICS
1998
103views more  HEURISTICS 1998»
13 years 10 months ago
Computing Approximate Solutions of the Maximum Covering Problem with GRASP
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
Mauricio G. C. Resende
ICTAI
2006
IEEE
14 years 5 months ago
Finding Crucial Subproblems to Focus Global Search
Traditional global search heuristics to solve constraint satisfaction problems focus on properties of an individual variable that mandate early search attention. If, however, one ...
Susan L. Epstein, Richard J. Wallace
COMBINATORICS
1998
66views more  COMBINATORICS 1998»
13 years 10 months ago
Some New Ramsey Colorings
New lower bounds for 15 classical Ramsey numbers are established. Several of the colorings are found using a new variation of local search heuristics. Several others are found usi...
Geoffrey Exoo
JPDC
2006
187views more  JPDC 2006»
13 years 11 months ago
Maximum lifetime data sensing and extraction in energy constrained networked sensor systems
We focus on data gathering problems in energy constrained networked sensor systems. The system operates in rounds where a subset of the sensors generate a certain number of data p...
Bo Hong, Viktor K. Prasanna
PC
2010
116views Management» more  PC 2010»
13 years 9 months ago
Distributed optimisation of a portfolio's Omega
• ‘Constructing 130/30-Portfolios with the Omega Ratio’, http://ssrn.com/abstract=1464798 (forthcoming, Journal of Asset Management), (with E. Schumann, G. di Tollo, G. Cabej...
Manfred Gilli, Enrico Schumann