Sciweavers

8413 search results - page 121 / 1683
» Ordering Problem Subgoals
Sort
View
RTCSA
1999
IEEE
14 years 13 days ago
Dynamic Adjustment of Serialization Order Using Timestamp Intervals in Real-Time Databases
Although an optimistic approach has been shown to be better than locking protocols for real-time database systems (RTDBS), it has the problems of unnecessary restarts and heavy re...
Jan Lindström, Kimmo E. E. Raatikainen
CP
2006
Springer
13 years 12 months ago
Retroactive Ordering for Dynamic Backtracking
Dynamic Backtracking (DBT) is a well known algorithm for solving Constraint Satisfaction Problems. In DBT, variables are allowed to keep their assignment during backjump, if they a...
Roie Zivan, Uri Shapen, Moshe Zazone, Amnon Meisel...
CAGD
2008
112views more  CAGD 2008»
13 years 8 months ago
On the approximation order of tangent estimators
A classic problem in geometric modelling is curve interpolation to data points. Some of the existing interpolation schemes only require point data, whereas others, require higher ...
G. Albrecht, J.-P. Bécar, Gerald E. Farin, ...
ICDE
2009
IEEE
192views Database» more  ICDE 2009»
14 years 10 months ago
Topologically Sorted Skylines for Partially Ordered Domains
The vast majority of work on skyline queries considers totally ordered domains, whereas in many applications some attributes are partially ordered, as for instance, domains of set ...
Dimitris Sacharidis, Stavros Papadopoulos, Dimitri...
KDD
2007
ACM
192views Data Mining» more  KDD 2007»
14 years 8 months ago
Allowing Privacy Protection Algorithms to Jump Out of Local Optimums: An Ordered Greed Framework
Abstract. As more and more person-specific data like health information becomes available, increasing attention is paid to confidentiality and privacy protection. One proposed mode...
Rhonda Chaytor