5699 search results - page 734 / 1140 » Alternating model trees |
164
click to vote
SWAT
1992
Springer
15 years 11 months ago
1992
Springer
Abstract. In a decision tree model, (n log2 n m i=1 ni log2 ni + n) is known to be a lower bound for sorting a multiset of size n containing m distinct elements, where the ith dist...
187
click to vote
CP
2004
Springer
15 years 10 months ago
2004
Springer
Scheduling is one of the most successful application areas of constraint programming mainly thanks to special global constraints designed to model resource restrictions. Among thes...
224
click to vote
CIAC
2006
Springer
15 years 10 months ago
2006
Springer
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
188
click to vote
APSEC
2001
IEEE
15 years 10 months ago
2001
IEEE
With the rapid growth of the Internet and pervasive computing activities, the migration of back-end legacy systems to network centric environments has become a focal point for res...
175
click to vote
VLDB
2000
ACM
15 years 10 months ago
2000
ACM
Modern database applications show a growing demand for efficient and dynamic management of intervals, particularly for temporal and spatial data or for constraint handling. Common...