Sciweavers

2080 search results - page 59 / 416
» Measuring empirical computational complexity
Sort
View
EDBT
2009
ACM
156views Database» more  EDBT 2009»
14 years 1 months ago
Efficient skyline retrieval with arbitrary similarity measures
A skyline query returns a set of objects that are not dominated by other objects. An object is said to dominate another if it is closer to the query than the latter on all factors...
Deepak P, Prasad M. Deshpande, Debapriyo Majumdar,...
CEC
2005
IEEE
13 years 12 months ago
Equilibrium selection by co-evolution for bargaining problems under incomplete information about time preferences
Abstract- The main purpose of this work is to measure the effect of bargaining players’ information completeness on agreements in evolutionary environments. We apply Co-evolution...
Nanlin Jin
IJON
2006
129views more  IJON 2006»
13 years 10 months ago
Computational and neural mechanisms of task switching
Switching between tasks that overlap in perceptual and response characteristics is assumed to rely upon the maintenance of task representations in prefrontal cortex (PFC). However...
Jeremy R. Reynolds, Todd S. Braver, Joshua W. Brow...
JAR
2006
106views more  JAR 2006»
13 years 10 months ago
Some Computational Aspects of distance-sat
In many AI fields, the problem of finding out a solution which is as close as possible to a given configuration has to be faced. This paper addresses this problem in a propositiona...
Olivier Bailleux, Pierre Marquis
SIGECOM
2006
ACM
184views ECommerce» more  SIGECOM 2006»
14 years 3 months ago
Computing pure nash equilibria in graphical games via markov random fields
We present a reduction from graphical games to Markov random fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Our result, wh...
Constantinos Daskalakis, Christos H. Papadimitriou