9997 search results - page 398 / 2000 » The case for crowd computing |
179
click to vote
INFOCOM
2007
IEEE
16 years 1 months ago
2007
IEEE
— We consider an uplink power control problem where each mobile wishes to maximize its throughput (which depends on the transmission powers of all mobiles) but has a constraint o...
167
click to vote
ACRI
2004
Springer
15 years 10 months ago
2004
Springer
We study herewith the simple threshold cellular automata (CA), as perhaps the simplest broad class of CA with non-additive (i.e., non-linear and non-affine) local update rules. We ...
171
click to vote
ECML
1991
Springer
15 years 10 months ago
1991
Springer
Robust reasoning requires learning from problem solving episodes. Past experience must be compiled to provide adaptation to new contingencies and intelligent modification of solut...
180
click to vote
CC
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. The problem of testing membership in the subset of the natural numbers produced at the output gate of a {∪, ∩,− , +, ×} combinational circuit is shown to capture a...
127
click to vote
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
— In this paper we study the Carnot-Caratheodory metrics on SU(2) S3 , SO(3) and SL(2) induced by their Cartan decomposition and by the Killing form. Besides computing explicitly...