1383 search results - page 185 / 277 » On the Complexity of the Interlace Polynomial |
161
click to vote
IJCAI
2003
15 years 7 months ago
2003
Utility elicitation is a critical function of any automated decision aid, allowing decisions to be tailored to the preferences of a specific user. However, the size and complexit...
199
click to vote
WSC
2004
15 years 7 months ago
2004
Group behaviors, e.g. birds flocking, are widely used in virtual reality, computer games, robotics and artificial life. While many methods to simulate group behaviors have been pr...
157
click to vote
AAAI
2000
15 years 7 months ago
2000
We present a new algorithm that reduces the space complexity of heuristic search. It is most effective for problem spaces that grow polynomially with problem size, but contain lar...
159
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
177
click to vote
AAECC
2010
Springer
15 years 6 months ago
2010
Springer
The aim of this paper is a comprehensive presentation of the geometrical tools which are necessary to prove the correctness of several up to date algorithms with intrinsic complex...