Sciweavers

3531 search results - page 43 / 707
» Virtualizing Disk Performance
Sort
View
AAAI
2008
13 years 10 months ago
Minimizing Disk I/O in Two-Bit Breadth-First Search
We present a breadth-first search algorithm, two-bit breadthfirst search (TBBFS), which requires only two bits for each state in the problem space. TBBFS can be parallelized in se...
Richard E. Korf
COCOA
2008
Springer
13 years 9 months ago
Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph
Connected Vertex Cover Problem (CVC) is an NP-hard problem. The currently best known approximation algorithm for CVC has performance ration 2. This paper gives the first Polynomial...
Zhao Zhang, Xiaofeng Gao, Weili Wu
VR
2010
IEEE
173views Virtual Reality» more  VR 2010»
13 years 2 months ago
Comparative study of the performances of several haptic modalities for a 3D menu
We introduce a new technique of haptic guidance, for navigation and control of applications in virtual environments. We haptically simulate the collisions of the pointer with the ...
Caroline Essert-Villard, Antonio Capobianco
SPIRE
2004
Springer
14 years 1 months ago
Inferring Query Performance Using Pre-retrieval Predictors.
The prediction of query performance is an interesting and important issue in Information Retrieval (IR). Current predictors involve the use of relevance scores, which are time-cons...
Ben He, Iadh Ounis
PDP
2006
IEEE
14 years 1 months ago
A Distributed Query Structure to Explore Random Mappings in Parallel
We explore the possibilities to organize a query data structure in the main memories or hard disks of a cluster computer. The query data structure serves to improve the performanc...
Jan Heichler, Jorg Keller