Sciweavers

344 search results - page 62 / 69
» Mathematical Programming Embeddings of Logic
Sort
View
CORR
2011
Springer
165views Education» more  CORR 2011»
13 years 1 months ago
Tight Upper Bounds for Streett and Parity Complementation
Complementation of finite automata on infinite words is not only a fundamental problem in automata theory, but also serves as a cornerstone for solving numerous decision problem...
Yang Cai, Ting Zhang
NC
2008
122views Neural Networks» more  NC 2008»
13 years 9 months ago
Computation with finite stochastic chemical reaction networks
A highly desired part of the synthetic biology toolbox is an embedded chemical microcontroller, capable of autonomously following a logic program specified by a set of instructions...
David Soloveichik, Matthew Cook, Erik Winfree, Jeh...
MAM
2007
157views more  MAM 2007»
13 years 9 months ago
Executing large algorithms on low-capacity FPGAs using flowpath partitioning and runtime reconfiguration
This paper describes a new method of executing a software program on an FPGA for embedded systems. Rather than combine reconfigurable logic with a microprocessor core, this method...
Darrin M. Hanna, Michael DuChene
SYNTHESE
2011
239views more  SYNTHESE 2011»
13 years 4 months ago
Carnap on theoretical terms: structuralism without metaphysics
: Both realists and instrumentalists have found it difficult to understand (much less accept) Carnap’s developed view on theoretical terms, which attempts to stake out a neutral ...
Michael Friedman
CASES
2004
ACM
14 years 3 months ago
Analytical computation of Ehrhart polynomials: enabling more compiler analyses and optimizations
Many optimization techniques, including several targeted specifically at embedded systems, depend on the ability to calculate the number of elements that satisfy certain conditio...
Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vi...