2230 search results - page 30 / 446 » Reformulating Constraint Models Using Input Data |
186
click to vote
PLDI
2009
ACM
15 years 10 months ago
2009
ACM
Reasoning about string variables, in particular program inputs, is an important aspect of many program analyses and testing frameworks. Program inputs invariably arrive as strings...
ECAI
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Adaptive consistency is a solving algorithm for constraint networks. Its basic step is variable elimination: it takes a network as input, and producesan equivalent networ...
80
Voted
IROS
2008
IEEE
15 years 4 months ago
2008
IEEE
— This paper proposes an optimal gait generation framework using virtual constraint and learning optimal control. In this method, firstly, we add a constraint by a virtual poten...
JMLR
2010
14 years 4 months ago
2010
Bayesian principal component analysis (BPCA), a probabilistic reformulation of PCA with Bayesian model selection, is a systematic approach to determining the number of essential p...
KBSE
2008
IEEE
15 years 4 months ago
2008
IEEE
Finite state machine-based abstractions of software behaviour are popular because they can be used as the basis for a wide range of (semi-) automated verification and validation ...