Sciweavers

998 search results - page 26 / 200
» From Feasible Proofs to Feasible Computations
Sort
View
ICAISC
2010
Springer
13 years 9 months ago
Computer Assisted Peptide Design and Optimization with Topology Preserving Neural Networks
Abstract. We propose a non-standard neural network called TPNN which offers the direct mapping from a peptide sequence to a property of interest in order to model the quantitative ...
Jörg D. Wichard, Sebastian Bandholtz, Carsten...
WCET
2008
13 years 9 months ago
Computing time as a program variable: a way around infeasible paths
Conditional branches connect the values of program variables with the execution paths and thus with the execution times, including the worstcase execution time (WCET). Flow analys...
Niklas Holsti
ITSSA
2006
90views more  ITSSA 2006»
13 years 7 months ago
The UbiMedic Framework to Support Medical Emergencies by Ubiquitous Computing
: This paper investigates the feasibility of employing the Software Agent technology in the highly dynamic and variable context of healthcare emergency coordination and decision-su...
Francesco De Mola, Giacomo Cabri, Nicola Muratori,...
VLDB
1990
ACM
143views Database» more  VLDB 1990»
13 years 11 months ago
Synthesizing Database Transactions
Database programming requires having the knowledge of database semantics both to maintain database integrity and to explore more optimization opportunities. Automated programming ...
Xiaolei Qian
DATE
2010
IEEE
183views Hardware» more  DATE 2010»
14 years 18 days ago
Multithreaded code from synchronous programs: Extracting independent threads for OpenMP
—Synchronous languages offer a deterministic model of concurrency at the level of actions. However, essentially all compilers for synchronous languages compile these actions into...
Daniel Baudisch, Jens Brandt, Klaus Schneider