4047 search results - page 88 / 810 » Some Properties and Some Problems on Set Functors |
106
click to vote
IJRR
2008
14 years 12 months ago
2008
Robots must complete their tasks in spite of unreliable actuators and limited, noisy sensing. In this paper, we consider the information requirements of such tasks. What sensing a...
164
click to vote
DBWORKSHOPS
1992
15 years 1 months ago
1992
Godin, R. and R. Missaoui, An incremental concept formation approach for learning from databases, Theoretical Computer Science 133 (1994) 3533385. This paper describes a concept f...
114
click to vote
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
— The main task in OFDM downlink scheduling design is to maximize some kind of utility considering user specific as well as system induced constraints. A typical example is the ...
ISAAC
2009
Springer
15 years 4 months ago
2009
Springer
For a connected graph G = (V, E), a subset U ⊆ V is called a k-cut if U disconnects G, and the subgraph induced by U contains exactly k (≥ 1) components. More specifically, a ...
IJAR
2008
14 years 12 months ago
2008
Credal networks are models that extend Bayesian nets to deal with imprecision in probability, and can actually be regarded as sets of Bayesian nets. Credal nets appear to be power...