2941 search results - page 342 / 589 » The Myth of the Educational Computer |
174
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
This paper is a continuation of the study of topological properties of omega context free languages (-CFL). We proved in [Topological Properties of Omega Context Free Languages, T...
140
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Iterative algorithms aimed at solving some problems are discussed. For certain problems, such as finding a common point in the intersection of a finite number of convex sets, there...
179
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The proliferation of commercial cloud computing providers has generated significant interest in the scientific computing community. Much recent research has attempted to determine...
163
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We prove that the subset sum problem ax = x {0, 1}n (SUB) has a polynomial time computable certificate of infeasibility for all a with density at most 1/(2n), and for almost all ...
184
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Reachability and distance computation are known to be NL-complete in general graphs, but within UL co-UL if the graphs are planar. However, finding longest paths is known to be N...