搜索结果: 1-15 共查到“a Constraint”相关记录32条 . 查询时间(0.062 秒)
BUILDING FACADE MODELING UNDER LINE FEATURE CONSTRAINT BASED ON CLOSE-RANGE IMAGES
Close-range Image Line Feature Building Modeling
2018/5/15
To solve existing problems in modeling facade of building merely with point feature based on close-range images , a new method for modeling building facade under line feature constraint is proposed in...
上海财经大学微观经济学课件Chapter 2 Budget Constraint。
Constraint-based program analyses are appealing because elaborate analyses can be described with a concise and simple set of constraint generation rules. Constraint resolution algorithms have been dev...
A Toolkit for Constructing Type- and Constraint-Based Program Analyses
Constructing Type Constraint-Based Program Analyses
2016/5/24
BANE (the Berkeley Analysis Engine) is a publicly available toolkit for constructing type- and constraint-based program analyses.1 We describe the goals of the pro ject, the rationale for BANE's overa...
Partial Online Cycle Elimination in Inclusion Constraint Graphs
Partial Online Cycle Elimination Inclusion Constraint Graphs
2016/5/24
Many program analyses are naturally formulated and implemented using inclusion constraints. We present new results on the scalable implementation of such analyses based on two insights: rst, that onl...
Projection Merging: Reducing Redundancies in Inclusion Constraint Graphs
Projection Merging Reducing Redundancies Inclusion Constraint Graphs
2016/5/24
Inclusion-based program analyses are implemented by adding new edges to directed graphs. In most analyses, there are many di erent ways to add a transitive edge between two nodes, namely through each ...
The Set Constraint/CFL Reachability Connection in Practice
Set constraints context-free language reachability flow analysis type qualifiers
2016/5/24
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new reduction from Dyck-CFL r...
Banshee: A Scalable Constraint-Based Analysis Toolkit
Banshee Scalable Constraint-Based Analysis Toolkit
2016/5/24
We introduce Banshee, a toolkit for constructing constraintbased analyses. Banshee’s novel features include a code generator for creating customized constraint resolution engines, incremental analysis...
Small Formulas for Large Programs: On-line Constraint Simplification in Scalable Static Analysis
Small Formulas Large Programs On-line Constraint Simplification Scalable Static Analysis
2016/5/24
Static analysis techniques that represent program states as formulas typically generate a large number of redundant formulas that are incrementally constructed from previous formulas. In addition to q...
Introduction to Set Constraint-Based Program Analysis
Set Constraint-Based Program Analysis
2016/5/24
Introduction to Set Constraint-Based Program Analysis.
Optimal Portfolio Rules in Continuous Time When the Nonnegativity Constraint on Consumption is Binding
Optimal Portfolio Rules Continuous Time Consumption Binding
2015/5/13
Optimal Portfolio Rules in Continuous Time When the Nonnegativity Constraint on Consumption is Binding.
This essay examines how repugnance sometimes constrains what transactions and markets we see. When my colleagues and I have helped design markets and allocation procedures, we have often found that di...
Learning the Structure of Bayesian Networks with Constraint Satisfaction
Bayesian networks Constraint satisfaction Constraint-based Structure learning
2014/12/18
A Bayesian network is graphical representation of the probabilistic relationships among set of variables and can be used to encode expert knowledge about uncertain domains. The structure of this model...
Maximizing Utility of Consumption Subject to a Constraint on the Probability of Lifetime Ruin
Maximizing Utility Consumption Subject a Constraint Lifetime Ruin
2012/9/14
In this note, we explicitly solve the problem of maximizing utility of consumption (until the minimum of bankruptcy and the time of death) with a constraint on the probability of lifetime ruin, which ...
A control problem with fuel constraint and Dawson-Watanabe superprocesses
Dawson-Watanabe superprocess J-functional log-Laplace equation optimal sto-chastic control with fuel constraint optimal order execution
2012/9/14
We solve a class of control problems with fuel constraint by means of the log-Laplace trans-forms of J-functionals of Dawson–Watanabe superprocesses. This solution is related to the superprocess solut...