Sciweavers

1404 search results - page 264 / 281
» Complexity of admissible rules
Sort
View
OTM
2009
Springer
14 years 3 months ago
Semantic Event Correlation Using Ontologies
Complex event processing (CEP) is a software architecture paradigm that aims at low latency, high throughput, and quick adaptability of applications for supporting and improving ev...
Thomas Moser, Heinz Roth, Szabolcs Rozsnyai, Richa...
CODES
2007
IEEE
14 years 2 months ago
HW/SW co-design for Esterel processing
We present a co-synthesis approach that accelerates reactive software processing by moving the calculation of complex expressions into external combinational hardware. The startin...
Sascha Gädtke, Claus Traulsen, Reinhard von H...
GECCO
2007
Springer
135views Optimization» more  GECCO 2007»
14 years 2 months ago
A cumulative evidential stopping criterion for multiobjective optimization evolutionary algorithms
In this work we present a novel and efficient algorithm– independent stopping criterion, called the MGBM criterion, suitable for Multiobjective Optimization Evolutionary Algorit...
Luis Martí, Jesús García, Ant...
GTTSE
2007
Springer
14 years 2 months ago
Model Transformations for the Compilation of Multi-processor Systems-on-Chip
With the increase of amount of transistors which can be contained on a chip and the constant expectation for more sophisticated applications, the design of Systems-on-Chip (SoC) is...
Éric Piel, Philippe Marquet, Jean-Luc Dekey...
TCC
2007
Springer
86views Cryptology» more  TCC 2007»
14 years 2 months ago
Weakly-Private Secret Sharing Schemes
Abstract. Secret-sharing schemes are an important tool in cryptography that is used in the construction of many secure protocols. However, the shares’ size in the best known secr...
Amos Beimel, Matthew K. Franklin