Sciweavers

1102 search results - page 140 / 221
» Dynamic Constraint Models for Planning and Scheduling Proble...
Sort
View
129
Voted
CSCLP
2008
Springer
15 years 2 months ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul
TMC
2012
13 years 3 months ago
Relay-Assisted Transmission with Fairness Constraint for Cellular Networks
Abstract—We consider the problem of relay-assisted transmission for cellular networks. In the considered system, a source node together with n relay nodes are selected in a propo...
Erwu Liu, Qinqing Zhang, Kin K. Leung
132
Voted
JAIR
2006
157views more  JAIR 2006»
15 years 17 days ago
Decision-Theoretic Planning with non-Markovian Rewards
A decision process in which rewards depend on history rather than merely on the current state is called a decision process with non-Markovian rewards (NMRDP). In decisiontheoretic...
Sylvie Thiébaux, Charles Gretton, John K. S...
96
Voted
TON
2010
132views more  TON 2010»
14 years 11 months ago
The optimality of two prices: maximizing revenue in a stochastic communication system
—This paper considers the problem of pricing and transmission scheduling for an Access Point (AP) in a wireless network, where the AP provides service to a set of mobile users. T...
Longbo Huang, Michael J. Neely
INFSOF
2006
129views more  INFSOF 2006»
15 years 17 days ago
An interactive service customization model
: Mass customization has become one of the key strategies for a service provider to differentiate itself from its competitors in a highly segmented global service market. This pape...
Jian Cao, Jie Wang, Kincho H. Law, Shen-sheng Zhan...