192 search results - page 16 / 39 » On-Demand Bound Computation for Best-First Constraint Optimi... |
173
Voted
ICLP
2009
Springer
15 years 10 months ago
2009
Springer
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...
IPPS
2008
IEEE
15 years 4 months ago
2008
IEEE
In this paper, we introduce the new technique of HighConfidence Software Monitoring (HCSM), which allows one to perform software monitoring with bounded overhead and concomitantl...
RTSS
2005
IEEE
15 years 3 months ago
2005
IEEE
The design phase of any real-time system requires balancing the limited computational resources against the functional requirements and the performance of the application. The opt...
CORR
2011
Springer
14 years 1 months ago
2011
Springer
: The PDPTW is an optimization vehicles routing problem which must meet requests for transport between suppliers and customers satisfying precedence, capacity and time constraints....
ICRA
2008
IEEE
15 years 4 months ago
2008
IEEE
— Modeling robot motion planning with uncertainty in a Bayesian framework leads to a computationally intractable stochastic control problem. We seek hypotheses that can justify a...