2652 search results - page 437 / 531 » Privacy-preserving linear programming |
157
click to vote
SEBD
2001
15 years 4 months ago
2001
This paper introduces a new logical formalism, intended for temporal conceptual modelling, as a natural combination of the well-known description logic DLR and point-based linear ...
105
click to vote
UAI
2001
15 years 4 months ago
2001
In this work we focus on efficient heuristics for solving a class of stochastic planning problems that arise in a variety of business, investment, and industrial applications. The...
120
click to vote
IJCAI
2003
15 years 4 months ago
2003
A longstanding goal in planning research is the ability to generalize plans developed for some set of environments to a new but similar environment, with minimal or no replanning....
125
click to vote
STRINGOLOGY
2004
15 years 4 months ago
2004
We investigate the shortest common superstring problem (SCSSP). As SCSSP is APX-complete it cannot be approximated within an arbitrarily small performance ratio. One heuristic tha...
137
click to vote
UAI
2004
15 years 4 months ago
2004
Although many real-world stochastic planning problems are more naturally formulated by hybrid models with both discrete and continuous variables, current state-of-the-art methods ...