840 search results - page 74 / 168 » Inapproximability of Combinatorial Optimization Problems |
123
Voted
AIMSA
2010
Springer
14 years 7 months ago
2010
Springer
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...
117
click to vote
SIGECOM
2004
ACM
15 years 5 months ago
2004
ACM
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...
109
Voted
ICC
2009
IEEE
15 years 7 months ago
2009
IEEE
—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...
128
Voted
CONSTRAINTS
2008
15 years 16 days ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
112
Voted
IDEAS
2002
IEEE
15 years 5 months ago
2002
IEEE
Boolean expression simplification is a well-known problem in the history of Computer Science. The problem of determining prime implicates from an arbitrary Boolean expression has...