Sciweavers

4218 search results - page 587 / 844
» Complete sets of cooperations
Sort
View
ICIDS
2009
Springer
15 years 7 months ago
Digital Storytelling as a Whole-Class Learning Activity: Lessons from a Three-Years Project
This paper introduces PoliCultura, a project created by Politecnico di Milano for the Italian schools, which has just completed three years of deployment. Participating classes (wi...
Nicoletta Di Blas, Franca Garzotto, Paolo Paolini,...
IEAAIE
2009
Springer
15 years 7 months ago
An Efficient Algorithm for Maintaining Frequent Closed Itemsets over Data Stream
Data mining refers to the process of revealing unknown and potentially useful information from a large database. Frequent itemsets mining is one of the foundational problems in dat...
Show-Jane Yen, Yue-Shi Lee, Cheng-Wei Wu, Chin-Lin...
MATES
2009
Springer
15 years 7 months ago
Concurrently Decomposable Constraint Systems
In constraint satisfaction, decomposition is a common technique to split a problem in a number of parts in such a way that the global solution can be efficiently assembled from th...
Cees Witteveen, Wiebe van der Hoek, Nico Roos
100
Voted
MODELS
2009
Springer
15 years 7 months ago
A Modeling Language for Activity-Oriented Composition of Service-Oriented Software Systems
The proliferation of smart spaces and emergence of new standards, such as Web Services, have paved the way for a new breed of software systems. Often the complete functional and Qo...
Naeem Esfahani, Sam Malek, João Pedro Sousa...
SAT
2009
Springer
82views Hardware» more  SAT 2009»
15 years 7 months ago
Generalizing Core-Guided Max-SAT
Recent work has shown the value of using unsatisfiable cores to guide maximum satisfiability algorithms (Max-SAT) running on industrial instances [5,9,10,11]. We take this concep...
Mark H. Liffiton, Karem A. Sakallah