Sciweavers

805 search results - page 67 / 161
» Combinatorial optimization problems in self-assembly
Sort
View
IJAIT
2002
81views more  IJAIT 2002»
14 years 9 months ago
Guiding Constructive Search with Statistical Instance-Based Learning
Several real world applications involve solving combinatorial optimization problems. Commonly, existing heuristic approaches are designed to address specific difficulties of the u...
Orestis Telelis, Panagiotis Stamatopoulos
AIMSA
2010
Springer
14 years 5 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...
SIGECOM
2004
ACM
96views ECommerce» more  SIGECOM 2004»
15 years 3 months ago
A stochastic programming approach to scheduling in TAC SCM
In this paper, we combine two approaches to handling uncertainty: we use techniques for finding optimal solutions in the expected sense to solve combinatorial optimization proble...
Michael Benisch, Amy R. Greenwald, Victor Narodits...
ICC
2009
IEEE
157views Communications» more  ICC 2009»
15 years 4 months ago
Optimal Relay Assignment and Power Allocation in Selection Based Cooperative Cellular Networks
—We consider a system with a single base station communicating with multiple users over orthogonal channels while being assisted by multiple relays. Several recent works have sug...
Sachin Kadloor, Raviraj Adve
CONSTRAINTS
2008
138views more  CONSTRAINTS 2008»
14 years 10 months ago
Minimization of Locally Defined Submodular Functions by Optimal Soft Arc Consistency
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
Martin C. Cooper