347 search results - page 37 / 70 » Computable Versions of Basic Theorems in Functional Analysis |
117
click to vote
SIGECOM
2006
ACM
15 years 5 months ago
2006
ACM
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
CDC
2009
IEEE
15 years 4 months ago
2009
IEEE
— This work is concerned with the problem of characterizing and computing probabilistic bisimulations of diffusion processes. A probabilistic bisimulation relation between two su...
111
click to vote
DEDS
2010
14 years 9 months ago
2010
We consider Discrete Event Systems (DES) involving tasks with real-time constraints and seek to control processing times so as to minimize a cost function subject to each task mee...
NIPS
2000
15 years 1 months ago
2000
We introduce total wire length as salient complexity measure for an analysis of the circuit complexity of sensory processing in biological neural systems and neuromorphic engineer...
113
click to vote
FOCS
1998
IEEE
15 years 4 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...