Sciweavers

6432 search results - page 153 / 1287
» Classic Mechanism Design
Sort
View
ICCAD
2001
IEEE
89views Hardware» more  ICCAD 2001»
16 years 26 days ago
Sequential SPFDs
SPFDs are a mechanism to express flexibility in Boolean networks. Introduced by Yamashita et al. in the context of FPGA synthesis [4], they were extended later to general combina...
Subarnarekha Sinha, Andreas Kuehlmann, Robert K. B...
IROS
2007
IEEE
122views Robotics» more  IROS 2007»
15 years 10 months ago
Lagrangian dynamics of open multibody systems with generalized holonomic and nonholonomic joints
— Standard methods to model multibody systems are aimed at systems with configuration spaces isomorphic to Rn . This limitation leads to singularities and other artifacts in cas...
Vincent Duindam, Stefano Stramigioli
CORR
2004
Springer
94views Education» more  CORR 2004»
15 years 3 months ago
Quantum Computing, Postselection, and Probabilistic Polynomial-Time
I study the class of problems efficiently solvable by a quantum computer, given the ability to "postselect" on the outcomes of measurements. I prove that this class coin...
Scott Aaronson
SIGECOM
2009
ACM
91views ECommerce» more  SIGECOM 2009»
15 years 10 months ago
Destroy to save
We study the problem of how to allocate m identical items among n > m agents, assuming each agent desires exactly one item and has a private value for consuming the item. We as...
Geoffroy de Clippel, Victor Naroditskiy, Amy R. Gr...
ATAL
2004
Springer
15 years 9 months ago
A Study of Limited-Precision, Incremental Elicitation in Auctions
We investigate the design of iterative, limited-precision mechanisms for single-good auctions with dominant strategy equilibria. Our aim is to design mechanisms that minimize the ...
Alexander Kress, Craig Boutilier