16844 search results - page 225 / 3369 » How to Design Programs |
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 ...
155
click to vote
INFOCOM
2006
IEEE
16 years 18 days ago
2006
IEEE
— We discuss the evolution of teleconferencing and networked visualization applications to support 3-dimensional display technologies. The implications of a continuation of Moore...
142
click to vote
UM
2005
Springer
16 years 2 days ago
2005
Springer
The accuracy of a user model usually depends on the amount and quality of information available on the user’s states of interest. An eye-tracker provides data detailing where a u...
186
click to vote
ICCS
2001
Springer
15 years 11 months ago
2001
Springer
GRM and PROVE were originally designed and implemented as part of the P-GRADE graphical parallel program development environment running on clusters. In the framework of the bigges...
171
click to vote
ACSC
2005
IEEE
15 years 8 months ago
2005
IEEE
Gradiance On-Line Accelerated Learning GOAL is a system for creating and automatically grading homeworks, programming laboratories, and tests. Through the concept of root questi...