Sciweavers

2834 search results - page 367 / 567
» Representing Trees with Constraints
Sort
View
KBSE
2003
IEEE
15 years 11 months ago
A Model-Driven Approach to Non-Functional Analysis of Software Architectures
We present an approach to managing formal models using Model Driven Architecture (MDA) technologies that delivers analysis techniques through integration with the design tools and...
James Skene, Wolfgang Emmerich
PG
2003
IEEE
15 years 11 months ago
Bounding Recursive Procedural Models Using Convex Optimization
We present an algorithm to construct a tight bounding polyhedron for a recursive procedural model. We first use an iterated function system (IFS) to represent the extent of the p...
Orion Sky Lawlor, John C. Hart
IDA
2003
Springer
15 years 11 months ago
Fuzzy Clustering Based Segmentation of Time-Series
The segmentation of time-series is a constrained clustering problem: the data points should be grouped by their similarity, but with the constraint that all points in a cluster mus...
János Abonyi, Balazs Feil, Sandor Z. N&eacu...
DATE
2010
IEEE
148views Hardware» more  DATE 2010»
15 years 11 months ago
DVFS based task scheduling in a harvesting WSN for Structural Health Monitoring
— The task scheduler of an energy harvesting wireless sensor node (WSN) must adapt the task complexity and maximize the accuracy of the tasks within the constraint of limited ene...
A. Ravinagarajan, D. Dondi, Tajana Simunic Rosing
WOLLIC
2010
Springer
15 years 11 months ago
On Anaphora and the Binding Principles in Categorial Grammar
In type logical categorial grammar the analysis of an expression is a resource-conscious proof. Anaphora represents a particular challenge to this approach in that the antecedent ...
Glyn Morrill, Oriol Valentín