Sciweavers

388 search results - page 37 / 78
» A Mixed Closure-CSP Method to Solve Scheduling Problems
Sort
View
TEC
2002
152views more  TEC 2002»
13 years 8 months ago
Ant colony optimization for resource-constrained project scheduling
An ant colony optimization (ACO) approach for the resource-constrained project scheduling problem (RCPSP) is presented. Several new features that are interesting for ACO in general...
Daniel Merkle, Martin Middendorf, Hartmut Schmeck
RSP
1999
IEEE
128views Control Systems» more  RSP 1999»
14 years 1 months ago
3-D Floorplanning: Simulated Annealing and Greedy Placement Methods for Reconfigurable Computing Systems
The advances in the programmable hardware has lead to new architectures where the hardware can be dynamically adapted to the application to gain better performance. There are stil...
Kia Bazargan, Ryan Kastner, Majid Sarrafzadeh
ASPDAC
2008
ACM
135views Hardware» more  ASPDAC 2008»
13 years 10 months ago
Temperature-aware MPSoC scheduling for reducing hot spots and gradients
Thermal hot spots and temperature gradients on the die need to be minimized to manufacture reliable systems while meeting energy and performance constraints. In this work, we solve...
Ayse Kivilcim Coskun, Tajana Simunic Rosing, Keith...
DATE
1998
IEEE
92views Hardware» more  DATE 1998»
14 years 1 months ago
Multiple Behavior Module Synthesis Based on Selective Groupings
In this paper, we present an approach to synthesize multiple behavior modules. Given n DFGs to be implemented, the previous methods scheduled each of them sequentially, and implem...
Ju Hwan Yi, Hoon Choi, In-Cheol Park, Seung Ho Hwa...
ASIACRYPT
2007
Springer
14 years 3 months ago
How to Build a Hash Function from Any Collision-Resistant Function
Recent collision-finding attacks against hash functions such as MD5 and SHA-1 motivate the use of provably collision-resistant (CR) functions in their place. Finding a collision ...
Thomas Ristenpart, Thomas Shrimpton