Sciweavers

1921 search results - page 166 / 385
» The Student-Project Allocation Problem
Sort
View
AAI
2006
86views more  AAI 2006»
15 years 6 months ago
Geometric Task Decomposition in a Multi-Agent Environment
Task decomposition in a multi-agent environment is often performed online. This paper proposes a method for subtask allocation that can be performed before the agents are deployed...
Kaivan Kamali, Dan Ventura, Amulya Garga, Soundar ...
IOR
2010
94views more  IOR 2010»
15 years 3 months ago
Utility-Maximizing Resource Control: Diffusion Limit and Asymptotic Optimality for a Two-Bottleneck Model
We study a stochastic network that consists of two servers shared by two classes of jobs. Class 1 jobs require a concurrent occupancy of both servers while class 2 jobs use one se...
Heng-Qing Ye, David D. Yao
TSP
2010
15 years 1 months ago
Improving wireless physical layer security via cooperating relays
Physical (PHY) layer security approaches for wireless communications can prevent eavesdropping without upper layer data encryption. However, they are hampered by wireless channel c...
Lun Dong, Zhu Han, Athina P. Petropulu, H. Vincent...
ISSTA
2012
ACM
13 years 9 months ago
Static memory leak detection using full-sparse value-flow analysis
We introduce a static detector, Saber, for detecting memory leaks in C programs. Leveraging recent advances on sparse pointer analysis, Saber is the first to use a full-sparse va...
Yulei Sui, Ding Ye, Jingling Xue
SIGECOM
2003
ACM
122views ECommerce» more  SIGECOM 2003»
15 years 11 months ago
On polynomial-time preference elicitation with value queries
Preference elicitation — the process of asking queries to determine parties’ preferences — is a key part of many problems in electronic commerce. For example, a shopping age...
Martin Zinkevich, Avrim Blum, Tuomas Sandholm