Sciweavers

1658 search results - page 255 / 332
» Implementing Bit-addressing with Specialization
Sort
View
SAC
2006
ACM
13 years 10 months ago
Challenges in the compilation of a domain specific language for dynamic programming
Many combinatorial optimization problems in biosequence analysis are solved via dynamic programming. To increase programming productivity and program reliability, a domain specifi...
Robert Giegerich, Peter Steffen
JCP
2007
127views more  JCP 2007»
13 years 10 months ago
Comparison of Simple Power Analysis Attack Resistant Algorithms for an Elliptic Curve Cryptosystem
Abstract— Side channel attacks such as Simple Power Analysis(SPA) attacks provide a new challenge for securing algorithms from an attacker. Algorithms for elliptic curve point sc...
Andrew Byrne, Nicolas Meloni, Arnaud Tisserand, Em...
CCE
2005
13 years 10 months ago
Logic-based outer approximation for globally optimal synthesis of process networks
Process network problems can be formulated as Generalized Disjunctive Programs where a logicbased representation is used to deal with the discrete and continuous decisions. A new ...
María Lorena Bergamini, Pío A. Aguir...
TOPNOC
2008
13 years 10 months ago
Translating Message Sequence Charts to other Process Languages Using Process Mining
Message Sequence Charts (MSCs) are a well known language for specifying scenarios that describe how different actors (e.g., system components, people, or organizations) interact. M...
Kristian Bisgaard Lassen, Boudewijn F. van Dongen
TROB
2008
128views more  TROB 2008»
13 years 10 months ago
Convergence-Preserving Switching for Topology-Dependent Decentralized Systems
Abstract-- Stability analysis of decentralized control mechanisms for networked, coordinating systems has generally focused on specific controller implementations, such as nearest ...
Brian Shucker, Todd D. Murphey, John K. Bennett