1679 search results - page 17 / 336 » Scatter Search - Wellsprings and Challenges |
134
click to vote
AAAI
2012
13 years 10 days ago
2012
General Game Playing (GGP) agents must be capable of playing a wide variety of games skillfully. Monte-Carlo Tree Search (MCTS) has proven an effective reasoning mechanism for thi...
148
click to vote
CANS
2011
Springer
13 years 10 months ago
2011
Springer
At EUROCRYPT ’10, van Dijk, Gentry, Halevi and Vaikuntanathan presented simple fully-homomorphic encryption (FHE) schemes based on the hardness of approximate integer common div...
BIBE
2006
IEEE
15 years 4 months ago
2006
IEEE
We consider the planted motif search problem, a problem that arises from the need to find transcription factor-binding sites in genomic information. One of the fastest non-exact a...
SIGIR
2009
ACM
15 years 4 months ago
2009
ACM
We proposed and implemented a novel clustering algorithm called LAIR2, which has constant running time average for on-the-fly Scatter/Gather browsing [4]. Our experiments showed ...
WSCG
2001
14 years 11 months ago
2001
The creation and rendering of realistic water scenes is one of the challenging tasks in Computer Graphics. To reproduce the illumination and colour inside water bodies an algorith...