Sciweavers

9572 search results - page 249 / 1915
» Cover Algorithms and Their Combination
Sort
View
EC
2007
167views ECommerce» more  EC 2007»
15 years 6 months ago
Comparison-Based Algorithms Are Robust and Randomized Algorithms Are Anytime
Randomized search heuristics (e.g., evolutionary algorithms, simulated annealing etc.) are very appealing to practitioners, they are easy to implement and usually provide good per...
Sylvain Gelly, Sylvie Ruette, Olivier Teytaud
VL
2002
IEEE
110views Visual Languages» more  VL 2002»
15 years 11 months ago
Empirical Evidence that Algorithm Animation Promotes Understanding of Distributed Algorithms
Previous studies of program visualization have generally failed to provide convincing support for the benefits of algorithm animation in promoting the understanding of computatio...
Mihail Eduard Tudoreanu, Rong Wu, Ashley Hamilton-...
MMSEC
2004
ACM
137views Multimedia» more  MMSEC 2004»
15 years 12 months ago
Perturbed quantization steganography with wet paper codes
In this paper, we introduce a new approach to passive-warden steganography in which the sender embeds the secret message into a certain subset of the cover object without having t...
Jessica J. Fridrich, Miroslav Goljan, David Soukal
CIKM
2008
Springer
15 years 8 months ago
Multi-aspect expertise matching for review assignment
Review assignment is a common task that many people such as conference organizers, journal editors, and grant administrators would have to do routinely. As a computational problem...
Maryam Karimzadehgan, ChengXiang Zhai, Geneva G. B...

Book
357views
17 years 4 months ago
Foundations of Constraint Satisfaction
"Constraint satisfaction is a general problem in which the goal is to find values for a set of variables that will satisfy a given set of constraints. It is the core of many a...
Edward Tsang