Sciweavers

1568 search results - page 304 / 314
» The problem of examination questions in algorithmics
Sort
View
JETAI
2008
114views more  JETAI 2008»
13 years 7 months ago
On the nature of minds, or: truth and consequences
Are minds really dynamical or are they really symbolic? Because minds are bundles of computations, and because computation is always a matter of interpretation of one system by an...
Shimon Edelman
SIGKDD
2008
125views more  SIGKDD 2008»
13 years 7 months ago
Incremental pattern discovery on streams, graphs and tensors
Incremental pattern discovery targets streaming applications where the data continuously arrive incrementally. The questions are how to find patterns (main trends) incrementally; ...
Jimeng Sun
MANSCI
2007
90views more  MANSCI 2007»
13 years 7 months ago
Selecting a Selection Procedure
Selection procedures are used in a variety of applications to select the best of a finite set of alternatives. ‘Best’ is defined with respect to the largest mean, but the me...
Jürgen Branke, Stephen E. Chick, Christian Sc...
SIAMCOMP
1998
96views more  SIAMCOMP 1998»
13 years 7 months ago
Fault-Tolerant Computation in the Full Information Model
We initiate an investigation of general fault-tolerant distributed computation in the full-information model. In the full information model no restrictions are made on the computat...
Oded Goldreich, Shafi Goldwasser, Nathan Linial
CORR
2010
Springer
189views Education» more  CORR 2010»
13 years 7 months ago
An Optimal Dynamic Mechanism for Multi-Armed Bandit Processes
We consider the problem of revenue-optimal dynamic mechanism design in settings where agents' types evolve over time as a function of their (both public and private) experien...
Sham M. Kakade, Ilan Lobel, Hamid Nazerzadeh