1139 search results - page 59 / 228 » Bounded Ideation Theory |
MSS
2008
IEEE
13 years 9 months ago
2008
IEEE
: This paper develops a theory of probabilistic models for risky choices. Part of this theory can be viewed as an extension of the expected utility theory to account for bounded ra...
AMC
2007
13 years 9 months ago
2007
A hierarchical least squares (HLS) algorithm is derived in details for identifying MIMO ARX-like systems based on the hierarchical identification principle. It is shown that the ...
FOCS
2010
IEEE
13 years 7 months ago
2010
IEEE
Complexity theory typically studies the complexity of computing a function h(x) : {0, 1}m {0, 1}n of a given input x. A few works have suggested to study the complexity of genera...
CCS
2008
ACM
13 years 11 months ago
2008
ACM
Distance bounding protocols have been proposed for many security critical applications as a means of getting an upper bound on the physical distance to a communication partner. As...
STOC
2007
ACM
14 years 9 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...