5331 search results - page 359 / 1067 » Algebraic Methods for Optimization Problems |
161
Voted
IJCAI
2007
15 years 8 months ago
2007
Hypertree decomposition has been shown to be the most general CSP decomposition method. However, so far the exact methods are not able to find optimal hypertree decompositions of...
165
click to vote
IMCSIT
2010
15 years 4 months ago
2010
Ant Colony Optimization (ACO) is a stochastic search method that mimics the social behavior of real ants colonies, which manage to establish the shortest route to feeding sources a...
173
click to vote
GECCO
2005
Springer
16 years 8 days ago
2005
Springer
This paper presents an ant-based approach for solving the Traveling Salesman Problem (TSP). Novel concepts of this algorithm that distinguish it from the other heuristics are the ...
228
Voted
LCTRTS
2001
Springer
15 years 11 months ago
2001
Springer
Phase-decoupled methods for code generation are the state of the art in compilers for standard processors but generally produce code of poor quality for irregular target architect...
179
click to vote
IJCNN
2000
IEEE
15 years 11 months ago
2000
IEEE
The problem of designing input signals for optimal generalization in supervised learning is called active learning. In many active learning methods devised so far, the bias of the...