Sciweavers

511 search results - page 76 / 103
» Analysis of Multi-Organization Scheduling Algorithms
Sort
View
UPP
2004
Springer
14 years 1 months ago
Inverse Design of Cellular Automata by Genetic Algorithms: An Unconventional Programming Paradigm
Evolving solutions rather than computing them certainly represents an unconventional programming approach. The general methodology of evolutionary computation has already been know...
Thomas Bäck, Ron Breukelaar, Lars Willmes
INFOCOM
2006
IEEE
14 years 2 months ago
Dedicated Channels as an Optimal Network Support for Effective Transfer of Massive Data
— Instantaneous Fair Sharing (IFS) is a traditional network ideal prescribing to share the network capacity among competing applications fairly during any infinitesimal time int...
Sergey Gorinsky, Nageswara S. V. Rao
ICMCS
2010
IEEE
139views Multimedia» more  ICMCS 2010»
13 years 9 months ago
LyDAR: A LYrics Density based Approach to non-homogeneous music Resizing
In many scenarios, such as TV/radio advertising production, animation production, and presentation, music pieces are constrained in the metric of time. For example, an editor want...
Zhang Liu, Chaokun Wang, Lu Guo, Yiyuan Bai, Jianm...
ANOR
2007
80views more  ANOR 2007»
13 years 8 months ago
The minimum shift design problem
The min-SHIFT DESIGN problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the...
Luca Di Gaspero, Johannes Gärtner, Guy Kortsa...
IJES
2006
110views more  IJES 2006»
13 years 8 months ago
Partitioning bin-packing algorithms for distributed real-time systems
Embedded real-time systems must satisfy not only logical functional requirements but also para-functional properties such as timeliness, Quality of Service (QoS) and reliability. W...
Dionisio de Niz, Raj Rajkumar