Sciweavers

258 search results - page 40 / 52
» Relational Correspondences for Lattices with Operators
Sort
View
ECSQARU
2001
Springer
13 years 12 months ago
Social Choice, Merging, and Elections
Abstract. Intelligent agents have to be able to merge inputs received from different sources in a coherent and rational way. Recently, several proposals have been made for the merg...
Thomas Andreas Meyer, Aditya Ghose, Samir Chopra
SSD
2001
Springer
103views Database» more  SSD 2001»
13 years 12 months ago
Similarity of Cardinal Directions
Like people who casually assess similarity between spatial scenes in their routine activities, users of pictorial databases are often interested in retrieving scenes that are simil...
Roop K. Goyal, Max J. Egenhofer
ADBIS
2000
Springer
82views Database» more  ADBIS 2000»
13 years 12 months ago
A New Algorithm for Page Access Sequencing in Join Processing
Abstract. One of the fundamental problems in relational database management is the handling of the join operation. Two of the problems are: 1) finding a page access sequence which...
Andrew Lim, Wee-Chong Oon, Chi-Hung Chi
PKDD
1999
Springer
118views Data Mining» more  PKDD 1999»
13 years 11 months ago
Mining Possibilistic Set-Valued Rules by Generating Prime Disjunctions
We describe the problem of mining possibilistic set-valued rules in large relational tables containing categorical attributes taking a finite number of values. An example of such a...
Alexandr A. Savinov
EURONGI
2006
Springer
13 years 11 months ago
Job Scheduling for Maximal Throughput in Autonomic Computing Systems
Abstract. Autonomic computing networks manage multiple tasks over a distributed network of resources. In this paper, we view an autonomic computing system as a network of queues, w...
Kevin Ross, Nicholas Bambos