257 search results - page 4 / 52 » Computability over The Partial Continuous Functionals |
CCA
2005
Springer
13 years 11 months ago
2005
Springer
If one wishes to find out whether a computational problem over discrete data is solvable or how complex it is, the classical approach is to represent the discrete objects in quest...
WIOPT
2011
IEEE
13 years 1 months ago
2011
IEEE
Abstract—This paper considers maximizing throughput utility in a multi-user network with partially observable Markov ON/OFF channels. Instantaneous channel states are never known...
SSDBM
2008
IEEE
14 years 4 months ago
2008
IEEE
Abstract. Existing approaches to the management of streaming positional updates generally assume that all active user requests have equal importance, ignoring the possibility of an...
ICCS
2007
Springer
14 years 4 months ago
2007
Springer
Geocomputation has a long tradition in dealing with fuzzyness in different contexts, most notably in the challenges created by the representation of geographic space in digital for...
TPHOL
1995
IEEE
14 years 1 months ago
1995
IEEE
This paper presents a survey of HOLCF, a higher order logic of computable functions. The logic HOLCF is based on HOLC, a variant of the well known higher order logic HOL, which o e...