1532 search results - page 98 / 307 » The Symbol Grounding Problem |
109
click to vote
INTERACT
2003
15 years 5 months ago
2003
: This paper reports on current development of usability heuristics for large screen information exhibits. By basing the creation of such heuristics on real systems, and identifyin...
138
click to vote
ICCAD
1994
IEEE
15 years 8 months ago
1994
IEEE
1 This paper provides a new, generalized approach to the problem of encoding information as vectors of binary digits. We furnish a formal definition for the Boolean constrained enc...
104
click to vote
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
Coming up with a plan for a team that operates in a non-deterministic environment is a complex process, and the problem is further complicated by the need for team members to comm...
142
click to vote
MKM
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Recent work has detailed the conditions under which univariate Laurent polynomials have functional decompositions. This paper presents algorithms to compute such univaria...
132
click to vote
ALGORITHMICA
2010
15 years 4 months ago
2010
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...