Sciweavers

1929 search results - page 48 / 386
» An Approach to Limit the Wynot Problem
Sort
View
ICML
2006
IEEE
16 years 7 months ago
Learning algorithms for online principal-agent problems (and selling goods online)
In a principal-agent problem, a principal seeks to motivate an agent to take a certain action beneficial to the principal, while spending as little as possible on the reward. This...
Vincent Conitzer, Nikesh Garera
KCAP
2003
ACM
15 years 11 months ago
A generic library of problem solving methods for scheduling applications
In this paper we describe a generic library of problemsolving methods (PSMs) for scheduling applications. Although, some attempts have been made in the past at developing librarie...
Dnyanesh G. Rajpathak, Enrico Motta, Zdenek Zdr&aa...
COR
2008
128views more  COR 2008»
15 years 6 months ago
Solving dynamic stochastic economic models by mathematical programming decomposition methods
Discrete-time optimal control problems arise naturally in many economic problems. Despite the rapid growth in computing power and new developments in the literature, many economic...
Mercedes Esteban-Bravo, Francisco J. Nogales
DATE
2007
IEEE
167views Hardware» more  DATE 2007»
16 years 19 days ago
A decomposition-based constraint optimization approach for statically scheduling task graphs with communication delays to multip
We present a decomposition strategy to speed up constraint optimization for a representative multiprocessor scheduling problem. In the manner of Benders decomposition, our techniq...
Nadathur Satish, Kaushik Ravindran, Kurt Keutzer
PERCOM
2006
ACM
16 years 5 months ago
A Multi-Commodity Flow Approach for Globally Aware Routing in Multi-Hop Wireless Networks
Routing in multi-hop wireless networks is typically greedy, with every connection attempting to establish a path that minimizes its number of hops. However, interference plays a m...
Vinay Kolar, Nael B. Abu-Ghazaleh