840 search results - page 87 / 168 » Inapproximability of Combinatorial Optimization Problems |
COMPSAC
2004
IEEE
15 years 4 months ago
2004
IEEE
While meta-heuristics are effective for solving large-scale combinatorial optimization problems, they result from time-consuming trial-and-error algorithm design tailored to speci...
121
Voted
ICUMT
2009
14 years 10 months ago
2009
This paper introduces a Combinatory Optimization Problem (COP) which captures the performance in cooperation of a P2P Streaming Network, considered at the buffer level. A new famil...
133
click to vote
CONEXT
2005
ACM
15 years 2 months ago
2005
ACM
Network measurement is essential for assessing performance issues, identifying and locating problems. Two common strategies are the passive approach that attaches specific device...
115
click to vote
IJCAI
2007
15 years 1 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
110
click to vote
ICGA
1997
15 years 1 months ago
1997
This paper presents a genetic algorithm (GA) with specialized encoding, initialization and local search genetic operators to optimize communication network topologies. This NPhard...