789 search results - page 51 / 158 » Solving Complex Problems Efficiently with Adaptive Automata |
CIC
2004
14 years 11 months ago
2004
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
CG
2008
Springer
14 years 9 months ago
2008
Springer
We address the problem of an efficient image-space reconstruction of adaptively sampled scenes in the context of point-based and line-based graphics. The imagespace reconstruction...
FORMATS
2008
Springer
14 years 11 months ago
2008
Springer
We consider two-player games played in real time on game structures with clocks and parity objectives. The games are concurrent in that at each turn, both players independently pro...
160
click to vote
ICC
2011
IEEE
13 years 9 months ago
2011
IEEE
—Ant colony optimization (ACO) is a probabilistic technique used for solving complex computational problems, such as finding optimal routes in networks. It has been proved to pe...
DATE
2007
IEEE
15 years 4 months ago
2007
IEEE
Recently, there has been a substantial interest in the design of systems that receive their energy from regenerative sources such as solar cells. In contrast to approaches that at...