Sciweavers

715 search results - page 94 / 143
» Automatic Programming for Sequence Control
Sort
View
IPPS
1998
IEEE
15 years 6 months ago
Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
Peter R. Cappello, Ömer Egecioglu
AINA
2007
IEEE
15 years 6 months ago
Specification Synthesis for Monitoring and Analysis of MANET Protocols
This paper introduces an approach to automatic synthesis of the specification models of routing protocol behavior from the observed flow of the network traffic. In particular, our...
Natalia Stakhanova, Samik Basu, Wensheng Zhang, Xi...
AAAI
2007
15 years 4 months ago
Synthesis of Constraint-Based Local Search Algorithms from High-Level Models
The gap in automation between MIP/SAT solvers and those for constraint programming and constraint-based local search hinders experimentation and adoption of these technologies and...
Pascal Van Hentenryck, Laurent D. Michel
ACMSE
2006
ACM
15 years 4 months ago
Phoenix-based clone detection using suffix trees
A code clone represents a sequence of statements that are duplicated in multiple locations of a program. Clones often arise in source code as a result of multiple cut/paste operat...
Robert Tairas, Jeff Gray
PERCOM
2004
ACM
16 years 1 months ago
PCOM - A Component System for Pervasive Computing
Applications in the Pervasive Computing domain are challenged by the dynamism in which their execution environment changes, e.g. due to user mobility. As a result, applications ha...
Christian Becker, Marcus Handte, Gregor Schiele, K...