Sciweavers

1091 search results - page 24 / 219
» On the temporal dimension of search
Sort
View
AIPS
2009
15 years 2 months ago
Using the Context-enhanced Additive Heuristic for Temporal and Numeric Planning
Planning systems for real-world applications need the ability to handle concurrency and numeric fluents. Nevertheless, the predominant approach to cope with concurrency followed b...
Patrick Eyerich, Robert Mattmüller, Gabriele ...
PIMRC
2010
IEEE
14 years 11 months ago
Contact surround in opportunistic networks
Abstract--Is the temporal dimension alone sufficient to characterize contacts in opportunistic networks? Several studies analyze the temporal aspect of contacts with significant re...
Nadjet Belblidia, Marcelo Dias de Amorim, Jeremie ...
PCM
2004
Springer
99views Multimedia» more  PCM 2004»
15 years 6 months ago
Indexing Issues in Supporting Similarity Searching
Indexing issues that arise in the support of similarity searching are presented. This includes a discussion of the curse of dimensionality, as well as multidimensional indexing, di...
Hanan Samet
IJCAI
2003
15 years 2 months ago
Comparing Best-First Search and Dynamic Programming for Optimal Multiple Sequence Alignment
Sequence alignment is an important problem in computational biology. We compare two different approaches to the problem of optimally aligning two or more character strings: bounde...
Heath Hohwald, Ignacio Thayer, Richard E. Korf
ICPP
1999
IEEE
15 years 5 months ago
An Offline Algorithm for Dimension-Bound Analysis
The vector-clock size necessary to characterize causality in a distributed computation is bounded by the dimension of the partial order induced by that computation. In an arbitrar...
Paul A. S. Ward