19866 search results - page 260 / 3974 » Computing all factorizations in *** |
143
click to vote
CCE
2007
15 years 6 months ago
2007
A problem of frequent interest in analyzing nonlinear ODE models of ecological systems is the location of equilibrium states and bifurcations. Interval-Newton techniques are explo...
178
click to vote
FOCS
2007
IEEE
16 years 1 months ago
2007
IEEE
We design a randomized polynomial time algorithm which, given a 3-tensor of real numbers A = {aijk}n i,j,k=1 such that for all i, j, k ∈ {1, . . . , n} we have ai jk = aik j = a...
180
Voted
IEEEPACT
1998
IEEE
15 years 11 months ago
1998
IEEE
Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priori...
180
click to vote
SOFSEM
2000
Springer
15 years 10 months ago
2000
Springer
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
165
click to vote
SIGUCCS
2000
ACM
15 years 10 months ago
2000
ACM
In a Collegiate setting, technology must be functional, effective, and highly visible. In the fall of 1999 the CIS department at Bowdoin College saw the need for a greater number ...