Sciweavers

709 search results - page 56 / 142
» On LR(k)-Parsers of Polynomial Size
Sort
View
CSR
2006
Springer
15 years 1 months ago
Unfolding Synthesis of Asynchronous Automata
Zielonka's theorem shows that each regular set of Mazurkiewicz traces can be implemented as a system of synchronized processes provided with some distributed control structure...
Nicolas Baudru, Rémi Morin
FPGA
1995
ACM
105views FPGA» more  FPGA 1995»
15 years 1 months ago
On Nominal Delay Minimization in LUT-based FPGA Technology Mapping
We study the nominal delay minimization problem in LUTbased FPGA technologymapping, where interconnect delay is assumed proportionalto net fanout size. We prove that the delay-opt...
Jason Cong, Yuzheng Ding
ESOP
2008
Springer
14 years 11 months ago
Inferring Channel Buffer Bounds Via Linear Programming
We present a static analysis for inferring the maximum amount of buffer space used by a program consisting of concurrently running processes communicating via buffered channels. We...
Tachio Terauchi, Adam Megacz
EUROGP
2008
Springer
105views Optimization» more  EUROGP 2008»
14 years 11 months ago
A Linear Estimation-of-Distribution GP System
We present N-gram GP, an estimation of distribution algorithm for the evolution of linear computer programs. The algorithm learns and samples the joint probability distribution of...
Riccardo Poli, Nicholas Freitag McPhee
SODA
2004
ACM
161views Algorithms» more  SODA 2004»
14 years 11 months ago
Approximation schemes for Metric Bisection and partitioning
We design polynomial time approximation schemes (PTASs) for Metric BISECTION, i.e. dividing a given finite metric space into two halves so as to minimize or maximize the sum of di...
Wenceslas Fernandez de la Vega, Marek Karpinski, C...