Sciweavers

1844 search results - page 165 / 369
» Exploiting the Structure of Distributed Constraint Optimizat...
Sort
View
AAAI
1998
15 years 7 months ago
Solving Very Large Weakly Coupled Markov Decision Processes
We present a technique for computing approximately optimal solutions to stochastic resource allocation problems modeled as Markov decision processes (MDPs). We exploit two key pro...
Nicolas Meuleau, Milos Hauskrecht, Kee-Eung Kim, L...
IPPS
2007
IEEE
16 years 18 days ago
A Comparative Study of Parallel Metaheuristics for Protein Structure Prediction on the Computational Grid
A comparative study of parallel metaheuristics executed in grid environments is proposed, having as case study a genetic algorithm, a simulated annealing algorithm and a random se...
Alexandru-Adrian Tantar, Nouredine Melab, El-Ghaza...
EDOC
2009
IEEE
16 years 1 months ago
An End-to-End Approach for QoS-Aware Service Composition
Abstract—A simple and effective composition of software services into higher-level composite services is still a very challenging task. Especially in enterprise environments, Qua...
Florian Rosenberg, Predrag Celikovic, Anton Michlm...
176
Voted
MTA
2002
83views more  MTA 2002»
15 years 6 months ago
A Model for Availability of Quality of Service in Distributed Multimedia Systems
In this paper we introduce a new model for the definition and the implementation of quality of service (QoS) in distributed multimedia systems. The model provides both the users an...
Athanasios G. Malamos, Elias N. Malamas, Theodora ...
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
13 years 8 months ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar