Sciweavers

105 search results - page 9 / 21
» A Fast Algorithm for Moving Interface Problems
Sort
View
GECCO
2007
Springer
241views Optimization» more  GECCO 2007»
15 years 3 months ago
Binary ant algorithm
When facing dynamic optimization problems the goal is no longer to find the extrema, but to track their progression through the space as closely as possible. Over these kind of ov...
Carlos Fernandes, Agostinho C. Rosa, Vitorino Ramo...
GECCO
2006
Springer
206views Optimization» more  GECCO 2006»
15 years 1 months ago
A dynamically constrained genetic algorithm for hardware-software partitioning
In this article, we describe the application of an enhanced genetic algorithm to the problem of hardware-software codesign. Starting from a source code written in a high-level lan...
Pierre-André Mudry, Guillaume Zufferey, Gia...
GECCO
2007
Springer
151views Optimization» more  GECCO 2007»
15 years 3 months ago
Solving real-valued optimisation problems using cartesian genetic programming
Classical Evolutionary Programming (CEP) and Fast Evolutionary Programming (FEP) have been applied to realvalued function optimisation. Both of these techniques directly evolve th...
James Alfred Walker, Julian Francis Miller
MM
2005
ACM
141views Multimedia» more  MM 2005»
15 years 3 months ago
SEVA: sensor-enhanced video annotation
In this paper, we study how a sensor-rich world can be exploited by digital recording devices such as cameras and camcorders to improve a user’s ability to search through a larg...
Xiaotao Liu, Mark D. Corner, Prashant J. Shenoy
RT
2000
Springer
15 years 1 months ago
Fast Global Illumination Including Specular Effects
Rapidly simulating global illumination, including diffuse and glossy light transport is a very difficult problem. Finite element or radiosity approaches can achieve interactive si...
Xavier Granier, George Drettakis, Bruce Walter