11716 search results - page 316 / 2344 » Computable symbolic dynamics |
191
Voted
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
— Achieving the Nash equilibria for single objective games is known to be a computationally difficult problem. However there is a special class of equilibria called evolutionary...
155
click to vote
FTDCS
2004
IEEE
15 years 10 months ago
2004
IEEE
The aim of dynamic reconfiguration is to allow a system to evolve incrementally from one configuration to another at run-time, without restarting it or taking it offline. In recen...
159
click to vote
BMVC
2001
15 years 9 months ago
2001
This paper presents a novel illumination technique for image processing in environmentswhich are characterized by large intensity fluctuations and hence a high optical dynamic ra...
156
Voted
DAC
2009
ACM
16 years 7 months ago
2009
ACM
Don't-care conditions provide additional flexibility in logic synthesis and optimization. However, most work only focuses on the gate level because it is difficult to handle ...
164
click to vote
ICFP
2006
ACM
16 years 6 months ago
2006
ACM
Generic libraries, such as the C++ Standard Template Library (STL), provide flexible, high-performance algorithms and data types, along with functional specifications and performa...