26071 search results - page 4998 / 5215 » Making the |
153
click to vote
COMBINATORICS
1998
15 years 4 months ago
1998
A bivariate symmetric backwards recursion is of the form d[m, n] = w0(d[m− 1, n]+d[m, n−1])+ω1(d[m−r1, n−s1]+d[m−s1, n−r1])+· · ·+ωk(d[m−rk, n−sk] +d[m−sk, ...
121
click to vote
COMPUTER
1998
15 years 4 months ago
1998
ion layer3,4 hides hardware particulars from the higher levels of software but can also compromise performance and compatibility; the higher levels of software often make unwitting...
145
click to vote
CORR
1998
Springer
15 years 4 months ago
1998
Springer
Technology designers often strive to design systems that are flexible enough to be used in a wide range of situations. Software engineers, in particular, are trained to seek gener...
138
click to vote
IJRR
2002
15 years 4 months ago
2002
We present kinetic data structures for detecting collisions between a set of polygons that are moving continuously. Unlike classical collision detection methods that rely on bound...
137
click to vote
IJRR
2002
15 years 4 months ago
2002
We describe simple one-dimensional models of passive (no energy input, no control), generally dissipative, vertical hopping and oneball juggling. The central observation is that i...