Sciweavers

437 search results - page 17 / 88
» Automatic Generation of Implied Constraints
Sort
View
CP
2007
Springer
14 years 11 days ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
SCOPES
2004
Springer
14 years 1 months ago
DSP Code Generation with Optimized Data Word-Length Selection
Digital signal processing applications are implemented in embedded systems with fixed-point arithmetic to minimize the cost and the power consumption. To reduce the application ti...
Daniel Menard, Olivier Sentieys
TON
2008
103views more  TON 2008»
13 years 8 months ago
On the race of worms, alerts, and patches
We study the effectiveness of automatic patching and quantify the speed of patch or alert dissemination required for worm containment. We focus on random scanning as this is repres...
Milan Vojnovic, Ayalvadi J. Ganesh
SMA
2008
ACM
286views Solid Modeling» more  SMA 2008»
13 years 8 months ago
Controlled field generation for quad-remeshing
Quadrangular remeshing of triangulated surfaces has received an increasing attention in recent years. A particularly elegant approach is the extraction of quads from the streamlin...
Oliver Schall, Rhaleb Zayer, Hans-Peter Seidel
COMPSAC
2008
IEEE
13 years 8 months ago
Automated Code Generation for Industrial-Strength Systems
Model-driven engineering proposes to develop software systems by first creating an executable model of the system design and then transforming this model into an implementation. T...
Thomas Weigert, Frank Weil, Aswin van den Berg, Pa...