Sciweavers

577 search results - page 64 / 116
» Budget Feasible Mechanisms
Sort
View
NECO
2008
116views more  NECO 2008»
14 years 11 months ago
A (Somewhat) New Solution to the Variable Binding Problem
To perform automatic, unconscious inference, the human brain must solve the "binding problem" by correctly grouping properties with objects. Temporal binding models like...
Leon Barrett, Jerome Feldman, Liam Mac Dermed
JOT
2007
106views more  JOT 2007»
14 years 11 months ago
Extending eclipse RCP with dynamic update of active plug-ins
While the dynamic linking mechanism of modern programming languages, such as Java, allows loading of classes dynamically, it does not allow class reloading. Hence, dynamic linking...
Allan Raundahl Gregersen, Bo Nørregaard J&o...
PPSN
2010
Springer
14 years 9 months ago
More Effective Crossover Operators for the All-Pairs Shortest Path Problem
The all-pairs shortest path problem is the first non-artificial problem for which it was shown that adding crossover can significantly speed up a mutation-only evolutionary algorit...
Benjamin Doerr, Daniel Johannsen, Timo Kötzin...
JDCTA
2010
250views more  JDCTA 2010»
14 years 6 months ago
A Novel Non-Expansion Visual Secret Sharing Scheme For Binary Image
In visual cryptography, the secret can be any written text, graphical representation, or picture. This technique, some time called visual secret sharing (VSS), allows visual infor...
Thekra Abbas, Zou Beiji
MOBIQUITOUS
2008
IEEE
15 years 6 months ago
Context-aware fault tolerance in migratory services
Mobile ad hoc networks can be leveraged to provide ubiquitous services capable of acquiring, processing, and sharing real-time information from the physical world. Unlike Internet...
Oriana Riva, Josiane Nzouonta, Cristian Borcea