16666 search results - page 3300 / 3334 » Descriptive and Computational Complexity |
148
click to vote
IJET
2007
15 years 3 months ago
2007
Remarkable advances in instructional communication technology (ICT) have now made is possible to provide high levels of enrichment and the kinds of curricular differentiation that...
152
click to vote
IJON
2007
15 years 3 months ago
2007
Unlike the conventional neural network theories and implementations, Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden n...
145
click to vote
TCOM
2008
15 years 3 months ago
2008
We consider the problem of differentiated rate scheduling for the downlink (i.e., multi-antenna broadcast channel), in the sense that the rates required by different users must sat...
123
Voted
TCS
2008
15 years 3 months ago
2008
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...
113
click to vote
IPL
2007
15 years 3 months ago
2007
We prove that there is a polynomial time substitution (y1, . . . , yn) := g(x1, . . . , xk) with k << n such that whenever the substitution instance A(g(x1, . . . , xk)) of ...