16504 search results - page 408 / 3301 » New Problems, New Solutions |
210
click to vote
IJCSA
2007
15 years 6 months ago
2007
A large number of problems that occur in knowledge-representation, learning, VLSI-design, and other areas of artificial intelligence, are essentially satisfiability problems. The ...
181
click to vote
GECCO
2005
Springer
16 years 12 days ago
2005
Springer
We propose a new evolutionary approach to solve the 0/1 multiple knapsack problem. We approach the problem from a new viewpoint different from traditional methods. The most remar...
174
click to vote
IWPEC
2004
Springer
16 years 7 days ago
2004
Springer
Based on a series of known and new examples, we propose the generalized setting of “distance from triviality” measurement as a reasonable and prospective way of determining use...
187
click to vote
WSC
2004
15 years 8 months ago
2004
This paper presents a new meta heuristic algorithm based on the search method called simulated annealing, and its application to solving multi objective simulation optimization pr...
196
click to vote
APAL
2011
15 years 1 months ago
2011
We define a new NP search problem, the “local improvement” principle, about labellings of an acyclic, bounded-degree graph. We show that, provably in PV, it characterizes the...