Sciweavers

3333 search results - page 363 / 667
» Abstract Proof Search
Sort
View
ANOR
2011
131views more  ANOR 2011»
15 years 1 months ago
A branch-and-bound algorithm for hard multiple knapsack problems
Abstract The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, br...
Alex S. Fukunaga
212
Voted
AIMSA
2010
Springer
15 years 1 months ago
Coalition Structure Generation with GRASP
Abstract. The coalition structure generation problem represents an active research area in multi-agent systems. A coalition structure is defined as a partition of the agents involv...
Nicola Di Mauro, Teresa Maria Altomare Basile, Ste...
MMS
2011
15 years 1 months ago
Dynamic behavior of balanced NV-trees
Abstract In recent years, some approximate highdimensional indexing techniques have shown promising results by trading off quality guarantees for improved query performance. While ...
Arnar Ólafsson, Björn Þór...
SOCO
2012
Springer
14 years 2 months ago
Variable mesh optimization for continuous optimization problems
Abstract Population-based meta-heuristics are algorithms that can obtain very good results for complex continuous optimization problems in a reduced amount of time. These search al...
Amilkar Puris, Rafael Bello, Daniel Molina, Franci...
HPDC
2003
IEEE
15 years 12 months ago
PlanetP: Using Gossiping to Build Content Addressable Peer-to-Peer Information Sharing Communities
Abstract. We present PlanetP, a peer-to-peer (P2P) content search and retrieval infrastructure targeting communities wishing to share large sets of text documents. P2P computing is...
Francisco Matias Cuenca-Acuna, Christopher Peery, ...