Sciweavers

90 search results - page 10 / 18
» Maximizing expected utility over a knapsack constraint
Sort
View
WSC
2008
14 years 12 months ago
Priority mix planning for cycle time-differentiated semiconductor manufacturing services
Semiconductor fabs often offer manufacturing service of multiple priorities in terms of cycle time-based X-factor targets (XFTs) and fab production must be planned accordingly. Th...
Shi-Chung Chang, Shin-Shyu Su, Ke-Ju Chen
AI
1999
Springer
14 years 9 months ago
Bucket Elimination: A Unifying Framework for Reasoning
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
Rina Dechter
ATAL
2003
Springer
15 years 2 months ago
Risk-averse auction agents
Auctions are an important means for purchasing material in the era of e-commerce. Research on auctions often studies them in isolation. In practice, however, auction agents are pa...
Yaxin Liu, Richard Goodwin, Sven Koenig
KDD
2012
ACM
292views Data Mining» more  KDD 2012»
13 years 1 days ago
Online allocation of display ads with smooth delivery
Display ads on the Internet are often sold in bundles of thousands or millions of impressions over a particular time period, typically weeks or months. Ad serving systems that ass...
Anand Bhalgat, Jon Feldman, Vahab S. Mirrokni
WIOPT
2011
IEEE
14 years 1 months ago
Open loop optimal control of base station activation for green networks
Abstract—In recent years there has been an increasing awareness that the deployment as well as utilization of new information technology may have some negative ecological impact....
Sreenath Ramanath, Veeraruna Kavitha, Eitan Altman