21108 search results - page 3877 / 4222 » A General Class of Models of |
229
click to vote
COCOS
2003
Springer
16 years 7 hour ago
2003
Springer
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
148
click to vote
DIS
2003
Springer
16 years 4 hour ago
2003
Springer
Computing abductive explanations is an important problem, which has been studied extensively in Artificial Intelligence (AI) and related disciplines. While computing some abductiv...
155
click to vote
DRM
2003
Springer
16 years 3 hour ago
2003
Springer
In this paper, we present our experiences concerning the enforcement of access rights extracted from ODRL-based digital contracts. We introduce the generalized Contract Schema (Co...
184
click to vote
COMPGEOM
2010
ACM
15 years 12 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
180
click to vote
PLDI
2010
ACM
15 years 12 months ago
2010
ACM
Self-adjusting computation provides an evaluation model where computations can respond automatically to modifications to their data by using a mechanism for propagating modifica...