Sciweavers

511 search results - page 27 / 103
» Using Combinatorial Optimization Methods for Quantification ...
Sort
View
ICS
1995
Tsinghua U.
15 years 1 months ago
Optimum Modulo Schedules for Minimum Register Requirements
Modulo scheduling is an e cient technique for exploiting instruction level parallelism in a variety of loops, resulting in high performance code but increased register requirement...
Alexandre E. Eichenberger, Edward S. Davidson, San...
ECAI
2000
Springer
15 years 2 months ago
Scheduling Meetings Using Distributed Valued Constraint Satisfaction Algorithm
Abstract. Scheduling meetings is generally difficult in that it attempts to satisfy the preferences of all participants. However, all participants can agree to a schedule in which...
Takuo Tsuruta, Toramatsu Shintani
DMIN
2006
144views Data Mining» more  DMIN 2006»
14 years 11 months ago
Discovering Assignment Rules in Workforce Schedules Using Data Mining
Discovering hidden patterns in large sets of workforce schedules to gain insight into the potential knowledge in workforce schedules are crucial to better understanding the workfor...
Jihong Yan
IWOMP
2009
Springer
15 years 4 months ago
Evaluating OpenMP 3.0 Run Time Systems on Unbalanced Task Graphs
The UTS benchmark is used to evaluate task parallelism in OpenMP 3.0 as implemented in a number of recently released compilers and run-time systems. UTS performs parallel search of...
Stephen Olivier, Jan Prins
EVOW
2012
Springer
13 years 5 months ago
Multiobjectivizing the HP Model for Protein Structure Prediction
Abstract. The hydrophobic-polar (HP) model for protein structure preabstracts the fact that hydrophobic interactions are a dominant force in the protein folding process. This model...
Mario Garza-Fabre, Eduardo Rodriguez-Tello, Gregor...