14699 search results - page 2642 / 2940 » Complexity and Cognitive Computing |
157
click to vote
CG
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
142
Voted
CGI
2004
IEEE
15 years 8 months ago
2004
IEEE
Objects and scenes in virtual worlds such as 3-d computer games are typically represented by polygonal surface meshes. On the other hand, physically-based simulations of deformati...
132
click to vote
ATAL
2006
Springer
15 years 8 months ago
2006
Springer
In this paper we incorporate autonomous agents' capability to perform parallel interactions into the cooperative search model, resulting in a new method which outperforms the...
155
click to vote
CEAS
2006
Springer
15 years 8 months ago
2006
Springer
One of the biggest challenges in building effective anti-spam solutions is designing systems to defend against the everevolving bag of tricks spammers use to defeat them. Because ...
163
click to vote
CIKM
2006
Springer
15 years 8 months ago
2006
Springer
We consider the problem of finding highly correlated pairs in a large data set. That is, given a threshold not too small, we wish to report all the pairs of items (or binary attri...