19866 search results - page 212 / 3974 » Computing all factorizations in *** |
168
click to vote
ECIS
2004
15 years 8 months ago
2004
This article analyzes the impact of a computer simulation (business game) on the users' perceived learning. The theoretical model developed in this paper is derived from the ...
164
click to vote
TCAD
2008
15 years 6 months ago
2008
Abstract--Recent analytical global placers use density constraints to approximate nonoverlap constraints, and these show very successful results. This paper unifies a wide range of...
264
click to vote
Book
"This book is intended for human factors engineers requiring current knowledge of how a computer graphics surrogate human can augment their analyses of designed environments. ...
147
click to vote
ISSAC
2007
Springer
16 years 22 days ago
2007
Springer
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
172
click to vote
ICS
2005
Tsinghua U.
16 years 3 days ago
2005
Tsinghua U.
We present a cache oblivious algorithm for stencil computations, which arise for example in finite-difference methods. Our algorithm applies to arbitrary stencils in n-dimension...