Sciweavers

1736 search results - page 183 / 348
» The rank-width of Directed Graphs
Sort
View
RAS
2007
153views more  RAS 2007»
15 years 6 months ago
Cognitive maps for mobile robots - an object based approach
Robots are rapidly evolving from factory work-horses to robot-companions. The future of robots, as our companions, is highly dependent on their abilities to understand, interpret ...
Shrihari Vasudevan, Stefan Gächter, Viet Nguy...
PVLDB
2008
121views more  PVLDB 2008»
15 years 6 months ago
Type inference and type checking for queries on execution traces
This paper studies, for the first time, the management of type information for an important class of semi-structured data: nested DAGs (Directed Acyclic Graphs) that describe exec...
Daniel Deutch, Tova Milo
JCO
2010
123views more  JCO 2010»
15 years 5 months ago
Capacity inverse minimum cost flow problem
Given a directed graph G = (N, A) with arc capacities uij and a minimum cost flow problem defined on G, the capacity inverse minimum cost flow problem is to find a new capacit...
Çigdem Güler, Horst W. Hamacher
JPDC
2010
137views more  JPDC 2010»
15 years 5 months ago
Parallel exact inference on the Cell Broadband Engine processor
—We present the design and implementation of a parallel exact inference algorithm on the Cell Broadband Engine (Cell BE). Exact inference is a key problem in exploring probabilis...
Yinglong Xia, Viktor K. Prasanna
MODELS
2010
Springer
15 years 5 months ago
Transforming Process Models: Executable Rewrite Rules versus a Formalized Java Program
Abstract. In the business process management community, transformations for process models are usually programmed using imperative languages (such as Java). The underlying mapping ...
Pieter Van Gorp, Rik Eshuis