Sciweavers

699 search results - page 16 / 140
» The method of combinatorial telescoping
Sort
View
CEC
2010
IEEE
13 years 5 months ago
A hybrid multi-objective extremal optimisation approach for multi-objective combinatorial optimisation problems
Extremal optimisation (EO) is a relatively recent nature-inspired heuristic whose search method is especially suitable to solve combinatorial optimisation problems. To date, most o...
Pedro Gómez-Meneses, Marcus Randall, Andrew...
CORR
2006
Springer
68views Education» more  CORR 2006»
13 years 8 months ago
A rigorous proof of the cavity method for counting matchings
In this paper we rigorously prove the validity of the cavity method for the problem of counting the number of matchings in graphs with large girth. Cavity method is an important he...
Mohsen Bayati, Chandra Nair
ATAL
2007
Springer
14 years 2 months ago
Combinatorial resource scheduling for multiagent MDPs
Optimal resource scheduling in multiagent systems is a computationally challenging task, particularly when the values of resources are not additive. We consider the combinatorial ...
Dmitri A. Dolgov, Michael R. James, Michael E. Sam...
SADM
2010
194views more  SADM 2010»
13 years 6 months ago
Seriation and matrix reordering methods: An historical overview
: Seriation is an exploratory combinatorial data analysis technique to reorder objects into a sequence along a one-dimensional continuum so that it best reveals regularity and patt...
Innar Liiv
ECBS
2009
IEEE
120views Hardware» more  ECBS 2009»
14 years 3 months ago
Tuning Complex Sensornet Systems Using Principled Engineering Methods
Sensornet lifespan and utility is limited by the energy resources of individual motes. Network designers seek to maximise energy efficiency while maintaining acceptable Quality o...
Jonathan Tate, Iain Bate