Sciweavers

496 search results - page 13 / 100
» WSD as a Distributed Constraint Optimization Problem
Sort
View
IOR
2010
128views more  IOR 2010»
13 years 4 months ago
Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint
The paper considers a stylized model of a dynamic assortment optimization problem, where given a limited capacity constraint, we must decide the assortment of products to offer to...
Paat Rusmevichientong, Zuo-Jun Max Shen, David B. ...
ECAI
2000
Springer
13 years 12 months ago
Scheduling Meetings Using Distributed Valued Constraint Satisfaction Algorithm
Abstract. Scheduling meetings is generally difficult in that it attempts to satisfy the preferences of all participants. However, all participants can agree to a schedule in which...
Takuo Tsuruta, Toramatsu Shintani
ICPP
2009
IEEE
14 years 2 months ago
Optimizing the Latency of Streaming Applications under Throughput and Reliability Constraints
In this paper, we deal with the problem of scheduling streaming applications on unreliable heterogeneous platforms. We use the realistic one-port model with full computation/commu...
Anne Benoit, Mourad Hakem, Yves Robert
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
12 years 10 months ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...
ATAL
2007
Springer
13 years 11 months ago
A swarm based approximated algorithm to the extended generalized assignment problem (E-GAP)
This paper addresses distributed task allocation in complex scenarios modeled using the distributed constraint optimization problem (DCOP) formalism. We propose and evaluate a nov...
Paulo Roberto Ferreira Jr., Felipe S. Boffo, Ana L...