Sciweavers

2905 search results - page 529 / 581
» Formal Memetic Algorithms
Sort
View
ICDT
2010
ACM
180views Database» more  ICDT 2010»
15 years 1 months ago
Composing local-as-view mappings: closure and applications
Schema mapping composition is a fundamental operation in schema management and data exchange. The mapping composition problem has been extensively studied for a number of mapping ...
Patricia C. Arocena, Ariel Fuxman, Renée J....
KDD
2010
ACM
235views Data Mining» more  KDD 2010»
15 years 1 months ago
New perspectives and methods in link prediction
This paper examines important factors for link prediction in networks and provides a general, high-performance framework for the prediction task. Link prediction in sparse network...
Ryan Lichtenwalter, Jake T. Lussier, Nitesh V. Cha...
EMSOFT
2009
Springer
15 years 1 months ago
Modular static scheduling of synchronous data-flow networks: an efficient symbolic representation
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
Marc Pouzet, Pascal Raymond
CAV
2006
Springer
165views Hardware» more  CAV 2006»
15 years 1 months ago
Bounded Model Checking of Concurrent Data Types on Relaxed Memory Models: A Case Study
Many multithreaded programs employ concurrent data types to safely share data among threads. However, highly-concurrent algorithms for even seemingly simple data types are difficul...
Sebastian Burckhardt, Rajeev Alur, Milo M. K. Mart...
ECAI
2006
Springer
15 years 1 months ago
A Real Generalization of Discrete AdaBoost
Scaling discrete AdaBoost to handle real-valued weak hypotheses has often been done under the auspices of convex optimization, but little is generally known from the original boost...
Richard Nock, Frank Nielsen