Sciweavers

666 search results - page 96 / 134
» The Pipelined Set Cover Problem
Sort
View
ENC
2004
IEEE
14 years 1 months ago
Continuous Mode Changes in Mechatronic Systems
This paper deals with the problem of controlling highly dynamic mechatronic systems. Such systems may work in several different operation modes, or even underlie continuous mode c...
Klaus Ecker, Andrei Tchernykh, Frank Drews, Silke ...
ESA
2006
Springer
111views Algorithms» more  ESA 2006»
14 years 1 months ago
Path Hitting in Acyclic Graphs
An instance of the path hitting problem consists of two families of paths, D and H, in a common undirected graph, where each path in H is associated with a non-negative cost. We r...
Ojas Parekh, Danny Segev
PARELEC
2002
IEEE
14 years 3 months ago
Techniques for Optimization of Net Algorithms
In this paper, techniques for optimization of net algorithms describing parallel asynchronous computations and derived from cycling and branching behavioral descriptions are prese...
Anatoly Prihozhy, Daniel Mlynek, Michail Solomenni...
FOSSACS
2007
Springer
14 years 2 months ago
The Complexity of Generalized Satisfiability for Linear Temporal Logic
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
Michael Bauland, Thomas Schneider 0002, Henning Sc...
ALENEX
2001
215views Algorithms» more  ALENEX 2001»
13 years 11 months ago
An Empirical Study of a New Approach to Nearest Neighbor Searching
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
Songrit Maneewongvatana, David M. Mount