Sciweavers

213 search results - page 35 / 43
» The randomized complexity of initial value problems
Sort
View
ECRTS
2005
IEEE
14 years 1 months ago
Non-blocking Deterministic Replacement of Functionality, Timing, and Data-Flow for Hard Real-Time Systems at Runtime
Embedded systems are usually an integral component of a larger system and are used to control and/or directly monitor this system by using special hardware devices. The complexity...
Sebastian Fischmeister, Klemens Winkler
EMO
2005
Springer
76views Optimization» more  EMO 2005»
14 years 1 months ago
Photonic Device Design Using Multiobjective Evolutionary Algorithms
Abstract. The optimization and design of two different types of photonic devices - a Fibre Bragg Grating and a Microstructured Polymer Optical Fibre is presented in light of multi...
Steven Manos, Leon Poladian, Peter J. Bentley, Mar...
W2GIS
2004
Springer
14 years 29 days ago
Expansion-Based Algorithms for Finding Single Pair Shortest Path on Surface
Abstract. Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path plannin...
Ke Deng, Xiaofang Zhou
IPPS
2010
IEEE
13 years 5 months ago
Towards dynamic reconfigurable load-balancing for hybrid desktop platforms
s the Pus using the OpenCL API as the platform independent programming model. It has the proposal to extend OpenCL with a module that schedule and balance the workload over the CPU...
Alécio Pedro Delazari Binotto, Carlos Eduar...
APNOMS
2006
Springer
13 years 11 months ago
An Enhanced RED-Based Scheme for Differentiated Loss Guarantees
Abstract. Recently, researchers have explored to provide a queue management scheme with differentiated loss guarantees for the future Internet. The Bounded Random Drop (BRD), known...
Jahwan Koo, Vladimir V. Shakhov, Hyunseung Choo