Sciweavers

1275 search results - page 79 / 255
» time 1998
Sort
View
MOC
1998
136views more  MOC 1998»
13 years 10 months ago
Total variation diminishing Runge-Kutta schemes
In this paper we further explore a class of high order TVD (total variation diminishing) Runge-Kutta time discretization initialized in a paper by Shu and Osher, suitable for solvi...
Sigal Gottlieb, Chi-Wang Shu
JCO
1998
80views more  JCO 1998»
13 years 10 months ago
Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem
We consider the problem of scheduling n jobs with release dates on m identical parallel machines to minimize the average completion time of the jobs. We prove that the ratio of the...
Cynthia A. Phillips, Andreas S. Schulz, David B. S...
KDD
1998
ACM
99views Data Mining» more  KDD 1998»
14 years 2 months ago
Learning to Predict the Duration of an Automobile Trip
In this paper, weexplore the use of machinelearning and data mining to improvethe prediction of travel times in an automobile. Weconsider two formulations of this problem, one tha...
Simon Handley, Pat Langley, Folke A. Rauscher
ACL
1998
13 years 11 months ago
Restrictions on Tree Adjoining Languages
Several methods are known for parsing languages generated by Tree Adjoining Grammars (TAGs) in O(n 6) worst case running time. In this paper we investigate which restrictions on T...
Giorgio Satta, William Schuler
PADS
1998
ACM
14 years 2 months ago
Fault-Tolerant Distributed Simulation
In traditional distributed simulation schemes, entire simulation needs to be restarted if any of the participating LP crashes. This is highly undesirable for long running simulati...
Om P. Damani, Vijay K. Garg