Sciweavers

2917 search results - page 497 / 584
» Satisfying Interaction Constraints
Sort
View
IJCAI
1989
13 years 11 months ago
Functional Representation of Designs and Redesign Problem Solving
gn problem can be abstractly characterized as a constrained function-to-structure mapping. The de­ sign task takes as input the specifications of the desired functions of a device...
Ashok K. Goel, B. Chandrasekaran
ATAL
2010
Springer
13 years 11 months ago
Worst-case efficiency ratio in false-name-proof combinatorial auction mechanisms
This paper analyzes the worst-case efficiency ratio of falsename-proof combinatorial auction mechanisms. False-nameproofness generalizes strategy-proofness by assuming that a bidd...
Atsushi Iwasaki, Vincent Conitzer, Yoshifusa Omori...
BMCBI
2008
122views more  BMCBI 2008»
13 years 10 months ago
Effects of dependence in high-dimensional multiple testing problems
Background: We consider effects of dependence among variables of high-dimensional data in multiple hypothesis testing problems, in particular the False Discovery Rate (FDR) contro...
Kyung In Kim, Mark A. van de Wiel
CORR
2010
Springer
93views Education» more  CORR 2010»
13 years 10 months ago
Parallelized Solution to Semidefinite Programmings in Quantum Complexity Theory
In this paper we present an equilibrium value based framework for solving SDPs via the multiplicative weight update method which is different from the one in Kale's thesis [K...
Xiaodi Wu
AI
2006
Springer
13 years 10 months ago
Complexity of constructing solutions in the core based on synergies among coalitions
Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish thing...
Vincent Conitzer, Tuomas Sandholm