Sciweavers

336 search results - page 15 / 68
» Program Speedups in Theory and Practice
Sort
View
192
Voted
SAC
2008
ACM
15 years 2 months ago
IELR(1): practical LR(1) parser tables for non-LR(1) grammars with conflict resolution
There has been a recent effort in the literature to reconsider grammar-dependent software development from an engineering point of view. As part of that effort, we examine a defic...
Joel E. Denny, Brian A. Malloy
ATAL
2009
Springer
15 years 10 months ago
Constraint-based dynamic programming for decentralized POMDPs with structured interactions
Decentralized partially observable MDPs (DEC-POMDPs) provide a rich framework for modeling decision making by a team of agents. Despite rapid progress in this area, the limited sc...
Akshat Kumar, Shlomo Zilberstein
BMCBI
2007
93views more  BMCBI 2007»
15 years 3 months ago
The topology of metabolic isotope labeling networks
Background: Metabolic Flux Analysis (MFA) based on isotope labeling experiments (ILEs) is a widely established tool for determining fluxes in metabolic pathways. Isotope labeling ...
Michael Weitzel, Wolfgang Wiechert, Katharina N&ou...
ICCAD
1995
IEEE
110views Hardware» more  ICCAD 1995»
15 years 7 months ago
Fast functional simulation using branching programs
This paper addresses the problem of speeding up functional (delayindependent)logic simulation for synchronousdigital systems. The problem needs very little new motivation – cycl...
Pranav Ashar, Sharad Malik
OOPSLA
2009
Springer
15 years 10 months ago
Optimizing programs with intended semantics
Modern object-oriented languages have complex features that cause programmers to overspecify their programs. This overspecification hinders automatic optimizers, since they must ...
Daniel von Dincklage, Amer Diwan