3171 search results - page 404 / 635 » Application of Reduce Order Modeling to Time Parallelization |
107
click to vote
SWAT
1992
Springer
15 years 8 months ago
1992
Springer
The k-compaction problem arises when k out of n cells in an array are non-empty and the contents of these cells must be moved to the first k locations in the array. Parallel algori...
133
Voted
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
In a data intensive Grid system, many data replica schemes and models have been proposed to improve the system response time or data consistency, but little attention has been pai...
123
click to vote
WSC
2008
15 years 6 months ago
2008
We introduce a new approach, called Relative Start and Idle Time (RSIT), to solve probabilistic scheduling problems of construction repetitive projects. RSIT is a process of deter...
128
click to vote
JSS
1998
15 years 3 months ago
1998
The graphical formalism of Petri Nets (PNs) is established on a strong mathematical foundation that can be applied in systems speci®cation, analysis and veri®cation. However, cl...
148
Voted
ICDM
2007
IEEE
15 years 10 months ago
2007
IEEE
We present an extension to the Lasso [9] for binary classification problems with ordered attributes. Inspired by the Fused Lasso [8] and the Group Lasso [10, 4] models, we aim to...