Sciweavers

11716 search results - page 316 / 2344
» Computable symbolic dynamics
Sort
View
CDC
2009
IEEE
165views Control Systems» more  CDC 2009»
16 years 6 days ago
Achieving symmetric Pareto Nash equilibria using biased replicator dynamics
— 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...
Kiran Somasundaram, John S. Baras
170
Voted
FTDCS
2004
IEEE
15 years 11 months ago
Platform-Independent Dynamic Reconfiguration of Distributed Applications
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...
João Paulo A. Almeida, Marten van Sinderen,...
BMVC
2001
15 years 10 months ago
Illumination technique for optical dynamic range compression and offset reduction
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...
C. Koch, S.-B. Park, Tim J. Ellis, A. Georgiadis
DAC
2009
ACM
16 years 8 months ago
Handling don't-care conditions in high-level synthesis and application for reducing initialized registers
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 ...
Hong-Zu Chou, Kai-Hui Chang, Sy-Yen Kuo
ICFP
2006
ACM
16 years 7 months ago
Towards an automatic complexity analysis for generic programs
Generic libraries, such as the C++ Standard Template Library (STL), provide flexible, high-performance algorithms and data types, along with functional specifications and performa...
Kyle D. Ross