3171 search results - page 123 / 635 » Application of Reduce Order Modeling to Time Parallelization |
116
click to vote
SC
1995
ACM
15 years 6 months ago
1995
ACM
Because large scienti c codes are rarely static objects, developers are often faced with the tedious task of accounting for discrepancies between new and old versions. In this pap...
164
click to vote
LATIN
2010
Springer
15 years 5 months ago
2010
Springer
We study the problem of designing truthful algorithms for scheduling a set of tasks, each one owned by a selfish agent, to a set of parallel (identical or unrelated) machines in or...
149
click to vote
SODA
2001
ACM
15 years 4 months ago
2001
ACM
We consider the problem of scheduling unit-length jobs on identical parallel machines such that the makespan of the resulting schedule is minimized. Precedence constraints impose ...
138
click to vote
JSSPP
2001
Springer
15 years 7 months ago
2001
Springer
This note briefly summarizes some results from two papers: [4] and [23]. These papers pose the following question: Is it possible to reduce the expected response time of every req...
143
click to vote
GIS
2010
ACM
15 years 19 days ago
2010
ACM
Mobile intention recognition is the problem of inferring a mobile user's intentions from her behavior in geographic space. Such behavior is constrained in space and time. Cur...