Sciweavers

657 search results - page 122 / 132
» On the Identification of a Class of Linear Models
Sort
View
SIGECOM
2006
ACM
139views ECommerce» more  SIGECOM 2006»
15 years 3 months ago
Playing games in many possible worlds
In traditional game theory, players are typically endowed with exogenously given knowledge of the structure of the game—either full omniscient knowledge or partial but fixed in...
Matt Lepinski, David Liben-Nowell, Seth Gilbert, A...
86
Voted
AMAI
2004
Springer
15 years 3 months ago
Approximate Probabilistic Constraints and Risk-Sensitive Optimization Criteria in Markov Decision Processes
The majority of the work in the area of Markov decision processes has focused on expected values of rewards in the objective function and expected costs in the constraints. Althou...
Dmitri A. Dolgov, Edmund H. Durfee
MCS
2002
Springer
14 years 9 months ago
Multiclassifier Systems: Back to the Future
Abstract. While a variety of multiple classifier systems have been studied since at least the late 1950's, this area came alive in the 90's with significant theoretical a...
Joydeep Ghosh
DNA
2009
Springer
173views Bioinformatics» more  DNA 2009»
15 years 4 months ago
Time-Complexity of Multilayered DNA Strand Displacement Circuits
Recently we have shown how molecular logic circuits with many components arranged in multiple layers can be built using DNA strand displacement reactions. The potential application...
Georg Seelig, David Soloveichik
SPAA
2004
ACM
15 years 3 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter