2941 search results - page 367 / 589 » The Myth of the Educational Computer |
198
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
188
click to vote
IEEECIT
2010
IEEE
15 years 4 months ago
2010
IEEE
This paper describes a successful integration of the IEEE micromouse competition training programme with regular undergraduate courses at Zhejiang University City College (ZUCC), H...
179
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...
125
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Circulant matrices play a central role in a recently proposed formulation of three-way data computations. In this setting, a three-way table corresponds to a matrix where each “...
106
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
: Most academic control schemes for MIMO systems assume all the control variables are updated simultaneously. MPC outperforms other control strategies through its ability to deal w...