840 search results - page 31 / 168 » Inapproximability of Combinatorial Optimization Problems |
CP
2003
Springer
14 years 4 months ago
2003
Springer
This paper aims to show that Constraint Programming can be an efficient technique to solve a well-known combinatorial optimization problem: the search for a maximum clique in a gra...
COR
2008
13 years 11 months ago
2008
The Swath Segment Selection Problem (SSSP) is an NP-hard combinatorial optimization problem arising in the context of planning and scheduling satellite operations. It was defined ...
COCOON
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. The infrastructure for mobile distributed tasks is often formed by cellular networks. One of the major issues in such networks is interference. In this paper we tackle in...
JGO
2010
13 years 9 months ago
2010
Both optimization and learning play important roles in a system for intelligent tasks. On one hand, we introduce three types of optimization tasks studied in the machine learning l...
CCE
2008
13 years 11 months ago
2008
A central problem in bioinformatics and systems biology is the selection of appropriate models in a rational and systematic way. This fundamentally combinatorial problem can be re...