5263 search results - page 1003 / 1053 » Open Constraint Optimization |
145
Voted
DLOG
2006
15 years 4 months ago
2006
Abstract. Modern description logic (DL) reasoners are known to be less efficient for DLs with inverse roles. The current loss of performance is largely due to the missing applicabi...
137
click to vote
NIPS
1998
15 years 4 months ago
1998
In this paper, we consider Markov Decision Processes (MDPs) with error states. Error states are those states entering which is undesirable or dangerous. We define the risk with re...
141
Voted
IJCAI
1997
15 years 4 months ago
1997
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
163
Voted
MM
2010
ACM
15 years 3 months ago
2010
ACM
We present an interactive application that enables users to improve the visual aesthetics of their digital photographs using spatial recomposition. Unlike earlier work that focuse...
147
Voted
SPAA
2010
ACM
15 years 3 months ago
2010
ACM
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...