4192 search results - page 281 / 839 » Probabilistic Logic Programming |
148
click to vote
AUTOMATICA
2007
15 years 6 months ago
2007
ust control problems can be formulated in abstract form as convex feasibility programs, where one seeks a solution x that satisfies a set of inequalities of the form F . = {f (x,...
201
click to vote
JIRS
2008
15 years 6 months ago
2008
Abstract This paper proposes an approach for reducing the computational complexity of a model-predictive-control strategy for discrete-time hybrid systems with discrete inputs only...
194
click to vote
UM
2005
Springer
16 years 2 days ago
2005
Springer
We present further developments in our work on using data from real users to build a probabilistic model of user affect based on Dynamic Bayesian Networks (DBNs) and designed to de...
161
click to vote
TPHOL
2007
IEEE
16 years 26 days ago
2007
IEEE
Terminator is a static analysis tool developed by Microsoft Research for proving termination of Windows device drivers written in C. This proof pearl describes a formalization in h...
183
click to vote
ENTCS
2002
15 years 6 months ago
2002
Non-deterministic computations greatly enhance the expressive power of functional logic programs, but are often computationally expensive. We analyze a programming technique that ...