Sciweavers

9736 search results - page 63 / 1948
» How Fast Can We Compute Products
Sort
View
SPLC
2010
15 years 2 months ago
Configuring Software Product Line Feature Models Based on Stakeholders' Soft and Hard Requirements
Abstract. Feature modeling is a technique for capturing commonality and variability. Feature models symbolize a representation of the possible application configuration space, and ...
Ebrahim Bagheri, Tommaso Di Noia, Azzurra Ragone, ...
CVPR
2007
IEEE
16 years 6 months ago
Fast Terrain Classification Using Variable-Length Representation for Autonomous Navigation
We propose a method for learning using a set of feature representations which retrieve different amounts of information at different costs. The goal is to create a more efficient ...
Anelia Angelova, Larry Matthies, Daniel M. Helmick...
159
Voted
RTA
2007
Springer
15 years 10 months ago
Rewriting Approximations for Fast Prototyping of Static Analyzers
This paper shows how to construct static analyzers using tree automata and rewriting techniques. Starting from a term rewriting system representing the operational semantics of the...
Yohan Boichut, Thomas Genet, Thomas P. Jensen, Luk...
CISIS
2010
IEEE
15 years 8 months ago
A Pattern-Based Coordination and Test Framework for Multi-Agent Simulation of Production Automation Systems
— Production automation systems consist of many entities (like robots and shuttles) that interact in complex ways to provide the overall system functionality like product assembl...
Thomas Moser, Munir Merdan, Stefan Biffl
PAMI
2012
13 years 7 months ago
BRIEF: Computing a Local Binary Descriptor Very Fast
Binary descriptors are becoming increasingly popular as a means to compare feature points very fast and while requiring comparatively small amounts of memory. The typical approach...
Michael Calonder, Vincent Lepetit, Mustafa Öz...