Sciweavers

3433 search results - page 231 / 687
» Heuristics for a bidding problem
Sort
View
CORR
2012
Springer
225views Education» more  CORR 2012»
14 years 2 months ago
Compressive Principal Component Pursuit
We consider the problem of recovering a target matrix that is a superposition of low-rank and sparse components, from a small set of linear measurements. This problem arises in co...
John Wright, Arvind Ganesh, Kerui Min, Yi Ma
WWW
2008
ACM
16 years 7 months ago
Externalities in online advertising
Most models for online advertising assume that an advertiser's value from winning an ad auction, which depends on the clickthrough rate or conversion rate of the advertisemen...
Arpita Ghosh, Mohammad Mahdian
COCOON
2005
Springer
16 years 6 days ago
Interval Subset Sum and Uniform-Price Auction Clearing
Abstract. We study the interval subset sum problem (ISSP), a generalization of the classic subset-sum problem, where given a set of intervals, the goal is to choose a set of intege...
Anshul Kothari, Subhash Suri, Yunhong Zhou
WECWIS
2006
IEEE
78views ECommerce» more  WECWIS 2006»
16 years 20 days ago
Improving Patient Activity Schedules by Multi-agent Pareto Appointment Exchanging
We present a dynamic and distributed approach to the hospital patient scheduling problem: the multi-agent Pareto-improvement appointment exchanging algorithm, MPAEX. It respects t...
Ivan B. Vermeulen, Sander M. Bohte, D. J. A. Somef...
DCOSS
2008
Springer
15 years 8 months ago
Energy-Efficient Task Mapping for Data-Driven Sensor Network Macroprogramming
Data-driven macroprogramming of wireless sensor networks (WSNs) provides an easy to use high-level task graph representation to the application developer. However, determining an e...
Animesh Pathak, Viktor K. Prasanna