Sciweavers

1355 search results - page 146 / 271
» Alternating Timed Automata over Bounded Time
Sort
View
ICTAI
2008
IEEE
14 years 3 months ago
The Performance of Approximating Ordinary Differential Equations by Neural Nets
—The dynamics of many systems are described by ordinary differential equations (ODE). Solving ODEs with standard methods (i.e. numerical integration) needs a high amount of compu...
Josef Fojdl, Rüdiger W. Brause
INFOVIS
2005
IEEE
14 years 2 months ago
Visualization of Graphs with Associated Timeseries Data
The most common approach to support analysis of graphs with associated time series data include: overlay of data on graph vertices for one timepoint at a time by manipulating a vi...
Purvi Saraiya, Peter Lee, Chris North
ESA
2006
Springer
136views Algorithms» more  ESA 2006»
14 years 23 days ago
Approximation in Preemptive Stochastic Online Scheduling
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
Nicole Megow, Tjark Vredeveld
UAI
2008
13 years 10 months ago
Efficient Inference in Persistent Dynamic Bayesian Networks
Numerous temporal inference tasks such as fault monitoring and anomaly detection exhibit a persistence property: for example, if something breaks, it stays broken until an interve...
Tomás Singliar, Denver Dash
SIAMDM
2002
124views more  SIAMDM 2002»
13 years 8 months ago
Scheduling Unrelated Machines by Randomized Rounding
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...
Andreas S. Schulz, Martin Skutella