Sciweavers

467 search results - page 44 / 94
» The General Yard Allocation Problem
Sort
View
224
Voted
ESA
2006
Springer
96views Algorithms» more  ESA 2006»
15 years 7 months ago
Finite Termination of "Augmenting Path" Algorithms in the Presence of Irrational Problem Data
This paper considers two similar graph algorithms that work by repeatedly increasing "flow" along "augmenting paths": the Ford-Fulkerson algorithm for the maxi...
Brian C. Dean, Michel X. Goemans, Nicole Immorlica

Lecture Notes
357views
17 years 2 months ago
Computational Mechanism Design
Iterative Combinatorial Auctions: Achieving Economic and Computational Efficiency Ph.D. dissertation, Univesity of Pennsylvania, May, 2001. The focus of this chapter is on the Gen...
David Parkes
157
Voted
JSS
2008
317views more  JSS 2008»
15 years 3 months ago
Predicting defect-prone software modules using support vector machines
Effective prediction of defectprone software modules can enable software developers to focus quality assurance activities and allocate effort and resources more efficiently. Supp...
Karim O. Elish, Mahmoud O. Elish
155
Voted
TON
2012
13 years 6 months ago
Power Control for Cognitive Radio Networks: Axioms, Algorithms, and Analysis
—The deployment of cognitive radio networks enables efficient spectrum sharing and opportunistic spectrum access. It also presents new challenges to the classical problem of int...
Siamak Sorooshyari, Chee Wei Tan, Mung Chiang
144
Voted
SIGECOM
2008
ACM
152views ECommerce» more  SIGECOM 2008»
15 years 3 months ago
On characterizations of truthful mechanisms for combinatorial auctions and scheduling
We characterize truthful mechanisms in two multi-parameter domains. The first characterization shows that every mechanism for combinatorial auctions with two subadditive bidders t...
Shahar Dobzinski, Mukund Sundararajan