706 search results - page 87 / 142 » Efficient Algorithms for k -Disjoint Paths Problems on DAGs |
PPDP
2010
Springer
13 years 6 months ago
2010
Springer
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...
APWEB
2003
Springer
14 years 16 days ago
2003
Springer
People display regularities in almost everything they do. This paper proposes characteristics of an idealized algorithm that would allow an automatic extraction of web user profil ...
CIKM
2007
Springer
14 years 26 days ago
2007
Springer
We investigate the problem of how to evaluate, fast and efficiently, classes of optimal route queries on a massive graph in a unified framework. To evaluate a route query effectiv...
WSC
2000
13 years 10 months ago
2000
This paper presents the development and simulation of a novel Genetic Algorithm (GA) based methodology applied to optimal tuning of a fuzzy dispatching system for a fleet of autom...
VLDB
2002
ACM
13 years 8 months ago
2002
ACM
The problem of indexing path queries in semistructured/XML databases has received considerable attention recently, and several proposals have advocated the use of structure indexe...