77 search results - page 6 / 16 » Neumann problems with time singularities |
ISVLSI
2002
IEEE
14 years 12 days ago
2002
IEEE
Retiming has been shown to be a powerful technique for improving the performance of synchronous circuits. However, even though retiming algorithms of polynomial time complexity ha...
IPL
2008
13 years 7 months ago
2008
In this paper, we prove polynomial running time bounds for an Ant Colony Optimization (ACO) algorithm for the single-destination shortest path problem on directed acyclic graphs. ...
VISUALIZATION
1998
IEEE
13 years 11 months ago
1998
IEEE
We attack the problem of image-based rendering with occlusions and general camera motions by using distorted multiperspective images; such images provide multiple-viewpoint photom...
CEC
2007
IEEE
14 years 1 months ago
2007
IEEE
—In recent years a lot of progress has been made in understanding the behavior of evolutionary computation methods for single- and multi-objective problems. Our aim is to analyze...
CEC
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract—Hybrid methods are very popular for solving problems from combinatorial optimization. In contrast to this the theoretical understanding of the interplay of different opt...