Sciweavers

349 search results - page 4 / 70
» Recursive Path Orderings Can Also Be Incremental
Sort
View
ICFP
2008
ACM
14 years 5 months ago
Write it recursively: a generic framework for optimal path queries
Optimal path queries are queries to obtain an optimal path specified by a given criterion of optimality. There have been many studies to give efficient algorithms for classes of o...
Akimasa Morihata, Kiminori Matsuzaki, Masato Takei...
ICDT
2005
ACM
139views Database» more  ICDT 2005»
13 years 11 months ago
First Order Paths in Ordered Trees
We give two sufficient conditions on XPath like languages for having first order expressivity, meaning that every first order definable set of paths in an ordered node-labeled t...
Maarten Marx
ICRA
2009
IEEE
131views Robotics» more  ICRA 2009»
13 years 3 months ago
Efficient C-space and cost function updates in 3D for unmanned aerial vehicles
When operating in partially-known environments, autonomous vehicles must constantly update their maps and plans based on new sensor information. Much focus has been placed on devel...
Sebastian Scherer, Dave Ferguson, Sanjiv Singh
TCOM
2008
92views more  TCOM 2008»
13 years 5 months ago
Mailbox switch: a scalable two-stage switch architecture for conflict resolution of ordered packets
Abstract-- Traditionally, conflict resolution in an inputbuffered switch is solved by finding a matching between inputs and outputs per time slot. To do this, a switch not only nee...
Cheng-Shang Chang, Duan-Shin Lee, Ying-Ju Shih, Ch...
CIE
2007
Springer
13 years 11 months ago
Binary Trees and (Maximal) Order Types
Concerning the set of rooted binary trees, one shows that Higman’s Lemma and Dershowitz’s recursive path ordering can be used for the decision of its maximal order type accordi...
Gyesik Lee