Sciweavers

1450 search results - page 176 / 290
» On the Complexity of Hardness Amplification
Sort
View
ENTCS
2006
109views more  ENTCS 2006»
13 years 9 months ago
Incremental Verification for On-the-Fly Controller Synthesis
The CIRCA system automatically synthesizes hard real-time discrete event controllers from plant and environment descriptions. CIRCA's automatically-synthesized controllers pr...
David J. Musliner, Michael J. S. Pelican, Robert P...
JAIR
2008
145views more  JAIR 2008»
13 years 9 months ago
Communication-Based Decomposition Mechanisms for Decentralized MDPs
Multi-agent planning in stochastic environments can be framed formally as a decentralized Markov decision problem. Many real-life distributed problems that arise in manufacturing,...
Claudia V. Goldman, Shlomo Zilberstein
CORR
2007
Springer
120views Education» more  CORR 2007»
13 years 9 months ago
Distributed Fair Scheduling Using Variable Transmission Lengths in Carrier-Sensing-based Wireless Networks
— The fairness of IEEE 802.11 wireless networks (including Wireless LAN and Ad-hoc networks) is hard to predict and control because of the randomness and complexity of the MAC co...
Libin Jiang, Jean C. Walrand
ML
2008
ACM
13 years 9 months ago
Margin-based first-order rule learning
Abstract We present a new margin-based approach to first-order rule learning. The approach addresses many of the prominent challenges in first-order rule learning, such as the comp...
Ulrich Rückert, Stefan Kramer
PPL
2008
101views more  PPL 2008»
13 years 9 months ago
Skeletal Parallel Programming with OCamlP3l 2.0
Parallel programming has proven to be an effective technique to improve the performance of computationally intensive applications. However, writing parallel programs is not easy, ...
Roberto Di Cosmo, Zheng Li, Susanna Pelagatti, Pie...