This paper studies a version of the job shop scheduling problem in which some operations have to be scheduled within non-relaxable time windows i.e. earliest latest possible start...
We consider an environment where one or more servers carry databases that are of interest to a community of clients. The clients are only intermittently connected to the server fo...
Sameer Mahajan, Michael J. Donahoo, Shamkant B. Na...
Traveling through immersive virtual environments (IVEs) by means of real walking is an important activity to increase naturalness of VR-based interaction. However, the size of the...
Frank Steinicke, Gerd Bruder, Luv Kohli, Jason Jer...
Developing cost models for query optimization is significantly harder for XML queries than for traditional relational queries. The reason is that XML query operators are much mor...
Ning Zhang 0002, Peter J. Haas, Vanja Josifovski, ...
This paper presents and reports on a VLIW code compression technique based on vector Hamming distances [19]. It investigates the appropriate selection of dictionary vectors such t...