Sciweavers

1329 search results - page 237 / 266
» Models and solution techniques for frequency assignment prob...
Sort
View
ICSOC
2004
Springer
15 years 10 months ago
Toward autonomic web services trust and selection
Emerging Web services standards enable the development of large-scale applications in open environments. In particular, they enable services to be dynamically bound. However, curr...
E. Michael Maximilien, Munindar P. Singh
ISPAN
2002
IEEE
15 years 10 months ago
Automatic Processor Lower Bound Formulas for Array Computations
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
Peter R. Cappello, Ömer Egecioglu
ATAL
2006
Springer
15 years 8 months ago
A hierarchical approach to efficient reinforcement learning in deterministic domains
Factored representations, model-based learning, and hierarchies are well-studied techniques for improving the learning efficiency of reinforcement-learning algorithms in large-sca...
Carlos Diuk, Alexander L. Strehl, Michael L. Littm...
COMPGEOM
2001
ACM
15 years 8 months ago
Computing a 3-dimensional cell in an arrangement of quadrics: exactly and actually!
We present two approaches to the problem of calculating a cell in a 3-dimensional arrangement of quadrics. The first approach solves the problem using rational arithmetic. It work...
Nicola Geismann, Michael Hemmer, Elmar Schöme...
FMCAD
2000
Springer
15 years 8 months ago
Automated Refinement Checking for Asynchronous Processes
Abstract. We consider the problem of refinement checking for asynchronous processes where refinement corresponds to stutter-closed language inclusion. Since an efficient algorithmi...
Rajeev Alur, Radu Grosu, Bow-Yaw Wang