Sciweavers

1568 search results - page 106 / 314
» The problem of examination questions in algorithmics
Sort
View
FLAIRS
2001
15 years 5 months ago
Combining Concept Mapping with CBR: Towards Experience-Based Support for Knowledge Modeling
Knowledge management depends on effective methods for capturing knowledge in useful forms and making it available when needed. Electronic concept maps provide a promising represen...
Alberto J. Cañas, David B. Leake, Ana Gabri...
FPL
2000
Springer
77views Hardware» more  FPL 2000»
15 years 8 months ago
Multiple-Wordlength Resource Binding
This paper describes a novel resource binding technique for use in multiple-wordlength systems implemented in FPGAs. It is demonstrated that the multiple-wordlength binding problem...
George A. Constantinides, Peter Y. K. Cheung, Wayn...
WEBDB
2004
Springer
79views Database» more  WEBDB 2004»
15 years 9 months ago
Scalable Dissemination: What's Hot and What's Not
A major problem in web database applications and on the Internet in general is the scalable delivery of data. One proposed solution for this problem is a hybrid system that uses m...
Jonathan Beaver, Nicholas Morsillo, Kirk Pruhs, Pa...
GECCO
2005
Springer
232views Optimization» more  GECCO 2005»
15 years 10 months ago
Factorial representations to generate arbitrary search distributions
A powerful approach to search is to try to learn a distribution of good solutions (in particular of the dependencies between their variables) and use this distribution as a basis ...
Marc Toussaint
ICDE
2010
IEEE
184views Database» more  ICDE 2010»
15 years 8 months ago
On optimal anonymization for l+-diversity
-- Publishing person specific data while protecting privacy is an important problem. Existing algorithms that enforce the privacy principle called l-diversity are heuristic based d...
Junqiang Liu, Ke Wang