Sciweavers

2916 search results - page 230 / 584
» Generating Rule Sets from Model Trees
Sort
View
IWPEC
2010
Springer
15 years 2 months ago
On the Kernelization Complexity of Colorful Motifs
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
Abhimanyu M. Ambalath, Radheshyam Balasundaram, Ch...
IROS
2008
IEEE
138views Robotics» more  IROS 2008»
15 years 11 months ago
Blended local planning for generating safe and feasible paths
Abstract— Many planning approaches adhere to the twotiered architecture consisting of a long-range, low fidelity global planner and a short-range high fidelity local planner. W...
Ling Xu, Anthony Stentz
AUTOMOTIVEUI
2009
ACM
15 years 11 months ago
Towards a flexible UI model for automotive human-machine interaction
In this paper we present an approach for creating user infrom abstract representations for the automotive domain. The approach is based on transformations between different user ...
Guido M. de Melo, Frank Honold, Michael Weber, Mar...
AI
2004
Springer
15 years 10 months ago
Distributed Data Mining vs. Sampling Techniques: A Comparison
To address the of mining a huge volume of geographically distributed databases, we propose two approaches. The first one is to download only a sample of each database. The second ...
Mohamed Aounallah, Sébastien Quirion, Guy W...
LICS
2008
IEEE
15 years 11 months ago
Winning Regions of Higher-Order Pushdown Games
In this paper we consider parity games defined by higher-order pushdown automata. These automata generalise pushdown automata by the use of higher-order stacks, which are nested ...
Arnaud Carayol, Matthew Hague, Antoine Meyer, C.-H...