Sciweavers

39 search results - page 3 / 8
» Improved Algorithms for Max-restricted Path Consistency
Sort
View
SWAT
1998
Springer
108views Algorithms» more  SWAT 1998»
13 years 9 months ago
Formal Language Constrained Path Problems
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...
Christopher L. Barrett, Riko Jacob, Madhav V. Mara...
TKDE
1998
111views more  TKDE 1998»
13 years 5 months ago
Efficient Data Mining for Path Traversal Patterns
—In this paper, we explore a new data mining capability that involves mining path traversal patterns in a distributed information-providing environment where documents or objects...
Ming-Syan Chen, Jong Soo Park, Philip S. Yu
CISS
2007
IEEE
13 years 12 months ago
Detecting Information Flows: Improving Chaff Tolerance by Joint Detection
— The problem of detecting encrypted information flows using timing information is considered. An information flow consists of both information-carrying packets and irrelevant ...
Ting He, Lang Tong
TVCG
2008
138views more  TVCG 2008»
13 years 5 months ago
Real-Time Path Planning in Dynamic Virtual Environments Using Multiagent Navigation Graphs
We present a novel approach for efficient path planning and navigation of multiple virtual agents in complex dynamic scenes. We introduce a new data structure, Multiagent Navigatio...
Avneesh Sud, Erik Andersen, Sean Curtis, Ming C. L...
WONS
2005
IEEE
13 years 11 months ago
Ant Agents for Hybrid Multipath Routing in Mobile Ad Hoc Networks
In this paper we describe AntHocNet, an algorithm for routing in mobile ad hoc networks based on ideas from the Nature-inspired Ant Colony Optimization framework. The algorithm co...
Frederick Ducatelle, Gianni Di Caro, Luca Maria Ga...