Sciweavers

725 search results - page 52 / 145
» Smoothed Analysis of Algorithms and Heuristics
Sort
View
IAT
2009
IEEE
15 years 1 months ago
Offline Planning for Communication by Exploiting Structured Interactions in Decentralized MDPs
Variants of the decentralized MDP model focus on problems exhibiting some special structure that makes them easier to solve in practice. Our work is concerned with two main issues...
Hala Mostafa, Victor R. Lesser
ANOR
2007
80views more  ANOR 2007»
14 years 10 months ago
The minimum shift design problem
The min-SHIFT DESIGN problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the...
Luca Di Gaspero, Johannes Gärtner, Guy Kortsa...
HYBRID
2010
Springer
15 years 4 months ago
Real-time scheduling of mixture-of-experts systems with limited resources
Mixture-of-Experts (MoE) systems solve intricate problems by combining results generated independently by multiple computational models (the “experts”). Given an instance of a...
Prapaporn Rattanatamrong, José A. B. Fortes
OOPSLA
2010
Springer
14 years 8 months ago
Parallel inclusion-based points-to analysis
Inclusion-based points-to analysis provides a good trade-off between precision of results and speed of analysis, and it has been incorporated into several production compilers inc...
Mario Méndez-Lojo, Augustine Mathew, Keshav...
CAV
2000
Springer
125views Hardware» more  CAV 2000»
15 years 1 months ago
Efficient Reachability Analysis of Hierarchical Reactive Machines
Hierarchical state machines is a popular visual formalism for software specifications. To apply automated analysis to such specifications, the traditional approach is to compile th...
Rajeev Alur, Radu Grosu, Michael McDougall