2845 search results - page 145 / 569 » Constraints over Ontologies |
176
click to vote
AAAI
2004
15 years 8 months ago
2004
This paper considers online stochastic optimization problems where time constraints severely limit the number of offline optimizations which can be performed at decision time and/...
171
click to vote
AAAI
2004
15 years 8 months ago
2004
A key feature of modern optimal planners such as Graphplan and Blackbox is their ability to prune large parts of the search space. Previous Partial Order Causal Link (POCL) planne...
178
click to vote
UAI
2003
15 years 8 months ago
2003
Abstract. In Datalog, missing values are represented by Skolem constants. More generally, in logic programming missing values, or existentially quantified variables, are represent...
130
click to vote
EOR
2000
15 years 6 months ago
2000
We introduce two pairs of nondifferentiable multiobjective second order symmetric dual problems with cone constraints over arbitrary closed convex cones, which is different from th...
145
click to vote
IJAIT
2002
15 years 6 months ago
2002
The adaptation of software technology to distributed environments is an important challenge today. In this work we combine parallel and distributed search. By this way we add the ...