Sciweavers

153 search results - page 10 / 31
» Solving Demand Versions of Interprocedural Analysis Problems
Sort
View
PASTE
2004
ACM
14 years 28 days ago
Resolving and applying constraint queries on context-sensitive analyses
A context-sensitive analysis is an analysis in which program elements are assigned sets of properties that depend upon the context in which they occur. For analyses on imperative ...
James Ezick
PAMI
2007
138views more  PAMI 2007»
13 years 7 months ago
A Fast Biologically Inspired Algorithm for Recurrent Motion Estimation
—We have previously developed a neurodynamical model of motion segregation in cortical visual area V1 and MT of the dorsal stream. The model explains how motion ambiguities cause...
Pierre Bayerl, Heiko Neumann
GECCO
2005
Springer
101views Optimization» more  GECCO 2005»
14 years 1 months ago
A scalable parallel genetic algorithm for x-ray spectroscopic analysis
We use a parallel multi-objective genetic algorithm to drive a search and reconstruction spectroscopic analysis of plasma gradients in inertial confinement fusion (ICF) implosion...
Kai Xu, Sushil J. Louis, Roberto C. Mancini
PASTE
1998
ACM
13 years 11 months ago
Efficient Composite Data Flow Analysis Applied to Concurrent Programs
FLAVERS, a tool for verifying properties of concurrent systems, uses composite data flow analysis to incrementally improve the precision of the results of its verifications. Altho...
Gleb Naumovich, Lori A. Clarke, Leon J. Osterweil
STOC
2004
ACM
107views Algorithms» more  STOC 2004»
14 years 7 months ago
Primal-dual algorithms for deterministic inventory problems
We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multi-stage assembly problem. ...
Retsef Levi, Robin Roundy, David B. Shmoys