Sciweavers

4539 search results - page 340 / 908
» Approaches to Compute Workflow Complexity
Sort
View
ASPDAC
1999
ACM
117views Hardware» more  ASPDAC 1999»
15 years 11 months ago
Analysing Forced Oscillators with Multiple Time Scales
We present a novel formulation, called the WaMPDE, for solving systems with forced autonomous components. An important feature of the WaMPDE is its ability to capture frequency mo...
Onuttom Narayan, Jaijeet S. Roychowdhury
ISCA
1996
IEEE
120views Hardware» more  ISCA 1996»
15 years 11 months ago
Missing the Memory Wall: The Case for Processor/Memory Integration
Current high performance computer systems use complex, large superscalar CPUs that interface to the main memory through a hierarchy of caches and interconnect systems. These CPU-c...
Ashley Saulsbury, Fong Pong, Andreas Nowatzyk
FASE
2000
Springer
15 years 10 months ago
From Play-In Scenarios to Code: An Achievable Dream
g higher levels of abstraction with automated downward transformations has always been the way to go, as long as the engineers who do the actual work are th the abstractions. A dev...
David Harel
EVOW
2010
Springer
15 years 10 months ago
Local Search Algorithms on Graphics Processing Units. A Case Study: The Permutation Perceptron Problem
Optimization problems are more and more complex and their resource requirements are ever increasing. Although metaheuristics allow to significantly reduce the computational complex...
Thé Van Luong, Nouredine Melab, El-Ghazali ...
WSC
2008
15 years 9 months ago
A simulation based optimization algorithm for slack reduction and workforce scheduling
In an assembly line with high labor proportion, the workforce planning and scheduling is a very complex problem. At the background of increasing labor costs, it is very important ...
Daniel Noack, Oliver Rose