Sciweavers

13987 search results - page 393 / 2798
» The Two Guards Problem
Sort
View
COCOON
2001
Springer
15 years 11 months ago
Competitive Online Scheduling with Level of Service
d by an application in thinwire visualization, we study an abstract on-line scheduling problem where the size of each requested service can be scaled down by the scheduler. Thus o...
Ee-Chien Chang, Chee-Keng Yap
ISMVL
2000
IEEE
120views Hardware» more  ISMVL 2000»
15 years 11 months ago
Mod-p Decision Diagrams: A Data Structure for Multiple-Valued Functions
Multiple-valued decision diagrams (MDDs) give a way of approaching problems by using symbolic variables which are often more naturally associated with the problem statement than t...
Harald Sack, Elena Dubrova, Christoph Meinel
SIGMOD
2000
ACM
143views Database» more  SIGMOD 2000»
15 years 11 months ago
Closest Pair Queries in Spatial Databases
This paper addresses the problem of finding the K closest pairs between two spatial data sets, where each set is stored in a structure belonging in the R-tree family. Five diffe...
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...
CIKM
1999
Springer
15 years 11 months ago
Page Access Scheduling in Join Processing
The join relational operation is one of the most expensive among database operations. In this study, we consider the problem of scheduling page accesses in join processing. This r...
Andrew Lim, Jennifer Lai-Pheng Kwan, Wee-Chong Oon
RIDE
1999
IEEE
15 years 11 months ago
Use of Roles and Policies for Specifying and Managing a Virtual Enterprise
One of the problems faced by an organisation participating in a virtual enterprise is how to specify internal and external aspects of the organisation in terms of the organisation...
Emil Lupu, Zoran Milosevic, Morris Sloman