Sciweavers

1679 search results - page 17 / 336
» Scatter Search - Wellsprings and Challenges
Sort
View
AAAI
2012
12 years 6 days ago
Generalized Monte-Carlo Tree Search Extensions for General Game Playing
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...
Hilmar Finnsson
CANS
2011
Springer
292views Cryptology» more  CANS 2011»
12 years 9 months ago
Breaking Fully-Homomorphic-Encryption Challenges
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...
Phong Q. Nguyen
BIBE
2006
IEEE
14 years 3 months ago
Extending Pattern Branching to Handle Challenging Instances
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...
Jaime Davila, Sanguthevar Rajasekaran
SIGIR
2009
ACM
14 years 4 months ago
Dynamicity vs. effectiveness: studying online clustering for scatter/gather
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 ...
Weimao Ke, Cassidy R. Sugimoto, Javed Mostafa
WSCG
2001
134views more  WSCG 2001»
13 years 11 months ago
Synthetic Images of Underwater Scenes: A First Approximation
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...
Eva Cerezo, Francisco J. Serón