Sciweavers

19130 search results - page 205 / 3826
» Modelling multi-path problems
Sort
View
KBS
2007
56views more  KBS 2007»
15 years 6 months ago
Domain-dependent distributed models for railway scheduling
Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so closure and heuristic search are usual...
Miguel A. Salido, Montserrat Abril, Federico Barbe...
SIAMAM
2011
15 years 1 months ago
A General Phase Transition Model for Vehicular Traffic
An extension of the Colombo phase transition model is proposed. The congestion phase is described by a two-dimensional zone defined around an equilibrium flux known as the classi...
Sebastien Blandin, Daniel B. Work, Paola Goatin, B...
INTERSPEECH
2010
15 years 1 months ago
Unsupervised discovery and training of maximally dissimilar cluster models
One of the difficult problems of acoustic modeling for Automatic Speech Recognition (ASR) is how to adequately model the wide variety of acoustic conditions which may be present i...
Françoise Beaufays, Vincent Vanhoucke, Bria...
CP
2009
Springer
16 years 7 months ago
The Complexity of Valued Constraint Models
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...
Peter G. Jeavons, Stanislav Zivný
QEST
2010
IEEE
15 years 4 months ago
Fortuna: Model Checking Priced Probabilistic Timed Automata
We introduce Fortuna, the first tool for model checking priced probabilistic timed automata (PPTAs). Fortuna can handle the combination of real-time, probabilistic and cost feature...
Jasper Berendsen, David N. Jansen, Frits W. Vaandr...