Sciweavers

384 search results - page 28 / 77
» Temporal Development Methods for Agent-Based
Sort
View
CAV
2008
Springer
170views Hardware» more  CAV 2008»
13 years 10 months ago
Local Proofs for Linear-Time Properties of Concurrent Programs
Abstract. This paper develops a local reasoning method to check lineartime temporal properties of concurrent programs. In practice, it is often infeasible to model check over the p...
Ariel Cohen 0002, Kedar S. Namjoshi
PKDD
2007
Springer
109views Data Mining» more  PKDD 2007»
14 years 2 months ago
Matching Partitions over Time to Reliably Capture Local Clusters in Noisy Domains
Abstract. When seeking for small clusters it is very intricate to distinguish between incidental agglomeration of noisy points and true local patterns. We present the PAMALOC algor...
Frank Höppner, Mirko Böttcher
KDD
2008
ACM
183views Data Mining» more  KDD 2008»
14 years 9 months ago
A bayesian mixture model with linear regression mixing proportions
Classic mixture models assume that the prevalence of the various mixture components is fixed and does not vary over time. This presents problems for applications where the goal is...
Xiuyao Song, Chris Jermaine, Sanjay Ranka, John Gu...
SAC
2002
ACM
13 years 8 months ago
A modular approach to build structured event-based systems
Event-based systems are developed and used as a coordination model to integrate components in loosely coupled systems. Research and product development focused so far on efficienc...
Ludger Fiege, Gero Mühl, Felix C. Gärtne...
ATAL
2005
Springer
14 years 2 months ago
Improving reinforcement learning function approximators via neuroevolution
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...
Shimon Whiteson