1887 search results - page 308 / 378 » An efficient search algorithm for partially ordered sets |
CP
2001
Springer
14 years 9 days ago
2001
Springer
Abstract. Computing lower bounds to the best-cost extension of a tuple is an ubiquous task in constraint optimization. A particular case of special interest is the computation of l...
SIGMOD
2000
ACM
14 years 5 days ago
2000
ACM
High dimensional data has always been a challenge for clustering algorithms because of the inherent sparsity of the points. Recent research results indicate that in high dimension...
TCOM
2008
13 years 7 months ago
2008
Abstract In multiuser MIMO systems, the base station schedules transmissions to a group of users simultaneously. Since the data transmitted to each user are different, in order to ...
AIR
2004
13 years 7 months ago
2004
Abstract. In this work we study an over-constrained scheduling problem where constraints cannot be relaxed. This problem originates from a local defense agency where activities to ...
NN
1998
Springer
13 years 7 months ago
1998
Springer
For complex database prediction problems such as medical diagnosis, the ARTMAP-IC neural network adds distributed prediction and category instance counting to the basic fuzzy ARTM...