3224 search results - page 343 / 645 » Review of Affective Computing |
181
Voted
AMAI
2000
Springer
15 years 9 months ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Comp...
131
click to vote
CG
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. In this paper we review the conventional versions of nullmove pruning, and present our enhancements which allow for a deeper search with greater accuracy. While the conve...
140
click to vote
CHINZ
2005
ACM
15 years 8 months ago
2005
ACM
It has been shown that people encounter difficulties in using representations and devices designed to assist navigating unfamiliar terrain. Literature review and self-reported vis...
145
click to vote
AIIA
2007
Springer
15 years 8 months ago
2007
Springer
We have recently presented CarpeDiem, an algorithm that can be used for speeding up the evaluation of Supervised Sequential Learning (SSL) classifiers. CarpeDiem provides impress...
180
click to vote
ACSW
2007
15 years 7 months ago
2007
Distributed management of data is one of the most important problems facing grids. Within the Enabling Grids for Enabling eScience (EGEE) project, currently the world’s largest ...