Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 17 of 17 for “"constraint graph"”.
-
A covering space approach to (d,k) constrained codes
… The topological properties of the (d, k) constraint graphs are examined. The fundamental group of a constraint graph and covering spaces of a constraint graph are discussed. A constructive process for building a covering space of a constraint graph is given. The construction of (d, k) …
-
Design and implementation of a synchronization scheduler in a distributed multimedia presentation system
… system. First, we develop an interval constraint graph model to describe the temporal relationships among media objects. Second, based on the model, we give a way to produce an optimal schedule from a set of constraints using a linear programming solver. Third, we develop a run time …
-
Multi-layer channel routing
… available. Previous techniques for modeling constraints which must be satisfied in order to produce a routing for a channel are unified by the definition of the channel constraint graph. r The intrinsic complexity of the channel routing problem is investigated and it is shown that channel …
-
EFFICIENT ALGORITHMS FOR OVER-THE-CELL CHANNEL ROUTING IN VLSI DESIGN USING TWO AND THREE ROUTING LAYERS
… reduces the longest path in the vertical constraint graph, as well as the maximum cliques in the horizontal constraint graph. At the same time, cycles in the vertical constraint graph are eliminated as much as possible. This algorithm performs better than all pervious algorithms. As tis …
-
Rozšířené regulární výrazy pro Z3-Noodler
… výrazů standardu ECMAScript. Zavádíme Regex Constraint Graph (RCG), formální model transformující komplexní funkce regulárních výrazů do systému řetězcových rovnic a omezení vhodných pro SMT solver. Navržený model byl implementován jako nativní C++ modul pro SMT solver Z3-Noodler. Vyhodnocení …
-
Power Distribution Network Analysis and Optimization in Digital VLSI Circuits
… techniques (namely, sensitivity analysis, constraint graph optimization, and reduced order modeling techniques) are also employed to improve the accuracy with little overhead in terms of the simulation time. An algorithm is developed to determine the conditions that will cause maximum delay …
-
Experimental study of algorithms for connected row convex constraints
… to solve the problems of the class of CRC constraints which is based on the ideas of variable elimination and the efficient composition of CRC constraints has been proposed. A path-consistency algorithm, PC-CRC, obtained by instantiating a generic path-consistency algorithm called PC-GEN …
-
From Value-Flow Graphs to Flow-Sensitive Constraint Graphs: Sparse Pointer Analysis
… which are conducted based on control flow graphs, have significantly advanced the precision of pointer analysis via sophisticated techniques to leverage control flow information. However, they inevitably suffer from computational inefficiencies when resolving points-to information due to …
-
Faster and More Precise Pointer Analysis Algorithms for Automatic Bug Detection
… the state-of-the-art by operating on a small subgraph of the entire points-to constraint graph at each iteration while still guaranteeing correctness. Our experimental results show that PUS is 2x faster in solving context-insensitive points-to constraints and 7x faster in solving …
-
Using Conflict and Support Counts for Variable and Value Ordering in CSPs
A Constraint Satisfaction Problem (CSP) is a very powerful framework for representing and solving constraint problems. Many real world computational problems in Artificial Intelligence and other areas of computer science can be formulated as CSPs. Problems such as scheduling and timetabling in …
-
Unique Games Conjecture : the Boolean Hypercube and connections to graph lifts
… validity of the Unique Games Conjecture when the constraint graph is restricted to the Boolean Hypercube. The Boolean Hypercube is a well studied graph family on which existing spectral methods fail to achieve a sub exponential time bound. We initiate the study of the behaviour of the standard …
-
Composing Controllers for Team Coherence Maintenance with Collision Avoidance
… to maintain proximity among agents by imposing constraints in the velocity space and restricting the set of feasible controls. If the introduction of LOCOs results in a problem that is too restrictive, then the proximity constraints are relaxed in order to maintain collision avoidance. A …
-
Constraint-based real-time scheduling for process control
… in industrial process control. It includes a constraint-based scheduler which is based on MSP.RTL, a tool for real-time multiprocessor scheduling problems with a wide variety of timing constraints. This dissertation extends previous work in two broad directions: improving the tool itself and …
-
Proto-libErator: Consumer-Code-Independent Library Fuzzing via Protobuf API Interposition
… The central claim is twofold. First, static constraint-guided initialization gives a practical head start: Proto-libErator reaches meaningful code regions early on libraries whose APIs are stateful and whose call surface can be represented effectively through typed constraints. Second, a …
-
Speeding up GDL-based distributed constraint optimization algorithms in cooperative multi-agent systems
… algorithms that are developed to process constraints in multi-agent systems. In particular, Distributed Constraint Optimization Problems (DCOPs) are a widely studied constraint handling framework for coordinating interactions in cooperative multi-agent systems. For the past decade, a …
-
Návrh a implementace nástroje pro formální verifikaci systémů specifikovaných jazykem RT logiky
Protože komplexnost systémů pořád roste a s tím také riziko výskytu chyb, je potřeba tyto chyby efektivně a spolehlivě opravovat. U řady systémů reálného času tato potřeba platí dvojnásob, jelikož byť jediná chyba může způsobit jejich úplné zhroucení, které může mít katastrofální důsledky. Formální …