1629 search results - page 237 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
GECCO
2009
Springer
15 years 2 months ago
2009
Springer
Encouraging exploration, typically by preserving the diversity within the population, is one of the most common method to improve the behavior of evolutionary algorithms with dece...
120
click to vote
TVCG
2011
14 years 4 months ago
2011
—This paper considers the problem of interactively finding the cutting contour to extract components from an existing mesh. First, we propose a constrained random walks algorith...
ASPDAC
2004
ACM
15 years 3 months ago
2004
ACM
- Data path connection elements, such as multiplexers, consume a significant amount of area on a VLSI chip, especially for FPGA designs. Multiplexer optimization is a difficult pro...
ICCV
2009
IEEE
16 years 1 months ago
2009
IEEE
Many solutions to computer vision and image processing problems involve the minimization of multi-label energy functions with up to K variables in each term. In the minimization pr...
ATAL
2010
Springer
14 years 11 months ago
2010
Springer
When agents need to interact in order to solve some (possibly common) problem, resolving potential conflicts beforehand is often preferred to coordination during execution. Agents...