2244 search results - page 87 / 449 » A new heuristic approach for non-convex optimization problem... |
142
click to vote
IPPS
1997
IEEE
15 years 10 months ago
1997
IEEE
The 0 1 MultidimensionalKnapsack Problem (0 1 MKP) is a NP-complete problem. Its resolution for large scale instances requires a prohibitive processing time. In this paper we prop...
353
click to vote
WWW
2011
ACM
15 years 20 days ago
2011
ACM
The explosion of Web opinion data has made essential the need for automatic tools to analyze and understand people’s sentiments toward different topics. In most sentiment analy...
154
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
In this paper, we present the application of evolutionary optimization methods to a demanding, industrially relevant engineering domain, the three-dimensional optimization of gas ...
176
click to vote
EVOW
2001
Springer
15 years 10 months ago
2001
Springer
This paper presents a new heuristic algorithm for the graph coloring problem based on a combination of genetic algorithms and simulated annealing. Our algorithm exploits a novel cr...
145
click to vote
AAAI
2004
15 years 7 months ago
2004
The resource-constrained project scheduling problem with time windows (RCPSP/max) is an important generalization of a number of well studied scheduling problems. In this paper, we...