Sciweavers

1063 search results - page 54 / 213
» Combining Simple Models to Approximate Complex Dynamics
Sort
View
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
13 years 11 months ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
IJON
2007
99views more  IJON 2007»
13 years 7 months ago
Criticality of avalanche dynamics in adaptive recurrent networks
In many studies of self-organized criticality (SOC), branching processes were used to model the dynamics of the activity of the system during avalanches. This mathematical simpliï...
Anna Levina, Udo Ernst, J. Michael Herrmann
CN
2006
75views more  CN 2006»
13 years 7 months ago
Dynamic online QoS routing schemes: Performance and bounds
Several dynamic QoS routing techniques have been recently proposed for new IP networks based on label forwarding. However, no extensive performance evaluation and comparison is av...
Antonio Capone, Luigi Fratta, Fabio Martignon
CDC
2008
IEEE
112views Control Systems» more  CDC 2008»
14 years 2 months ago
A preliminary study on the effects of roll dynamics in predictive vehicle stability control
Abstract— A Model Predictive Control (MPC) -based approach is presented for autonomous path following via Active Front Steering (AFS). We start from the Nonlinear MPC (NMPC) prob...
Giovanni Palmieri, Paolo Falcone, H. Eric Tseng, L...
WWW
2005
ACM
14 years 8 months ago
Constructing extensible XQuery mappings
Constructing and maintaining semantic mappings are necessary but troublesome in data sharing systems. While most current work focuses on seeking automated techniques to solve this...
Gang Qian, Yisheng Dong