Sciweavers

138 search results - page 13 / 28
» Finding an optimal tree searching strategy in linear time
Sort
View
HEURISTICS
2002
99views more  HEURISTICS 2002»
13 years 10 months ago
Parallelizing Tabu Search on a Cluster of Heterogeneous Workstations
In this paper, we present the parallelization of tabu search on a network of workstations using PVM. Two parallelization strategies are integrated: functional decomposition strate...
Ahmad A. Al-Yamani, Sadiq M. Sait, Habib Youssef, ...
NJC
2006
102views more  NJC 2006»
13 years 10 months ago
Online Evaluation of Regular Tree Queries
Regular tree queries (RTQs) are a class of queries considered especially relevant for the expressiveness and evaluation of XML query languages. The algorithms proposed so far for ...
Alexandru Berlea
JMLR
2006
117views more  JMLR 2006»
13 years 10 months ago
On the Complexity of Learning Lexicographic Strategies
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
Michael Schmitt, Laura Martignon
ICDE
2004
IEEE
105views Database» more  ICDE 2004»
14 years 11 months ago
SPINE: Putting Backbone into String Indexing
The indexing technique commonly used for long strings, such as genomes, is the suffix tree, which is based on a vertical (intra-path) compaction of the underlying trie structure. ...
Naresh Neelapala, Romil Mittal, Jayant R. Haritsa
ICDE
2000
IEEE
110views Database» more  ICDE 2000»
14 years 2 months ago
Optimal Index and Data Allocation in Multiple Broadcast Channels
The issue of data broadcast has received much attention in mobile computing. A periodic broadcast of frequently requested data can reduce the workload of the up-link channel and f...
Shou-Chih Lo, Arbee L. P. Chen