algorithms and efficient programming.
Efficient Algorithms for Program Equivalence for Confluent Concurrent Constraint Programming
... CNRS and LIX (UMR 7161 X-CNRS), ´ Ecole Polytechnique, 91128 Palaiseau Cedex, France Abstract Concurrent Constraint Programming (CCP) is a well-established declarative frame- work from concurrency ...
42
Learning Vision Algorithms for Real Mobile Robots with Genetic Programming
... genetic programming system to evolve vi- sion based obstacle avoidance ...images and com- mands is our learning base. Genetic programming is used as a supervised learning system to generate ...
7
Efficient Operations On MDDs For Building Constraint Programming Models
... new efficient algorithms for creating and reducing Multi-Valued Decision Diagrams ...space and time com- plexity and so may be used for huge ...union and complement of ...ones ...
8
Efficient Verification and New Reasoning Techniques for Concurrent Constraint Programming
... verification algorithms described above have an exponential-time complexity even for pro- grams from ...logic and an elegant denotational semantics, and it can be used to model real-world ...two ...
152
Efficient design and programming of Multiple Processors System on Chip architectures
... important and evolves exponentially with the number of ...mapping and the generation and execution of the SystemC simulator the TSRS framework take benefit of the metrics evaluation to save ...art ...
209
Opportunistic and Efficient Resource Block Allocation Algorithms for LTE Uplink Networks
... carrier and shares the transmission power equally over the allocated ...plexity and the terminal ...Modulation and Coding Scheme (MCS) robustness: defined by using the same MCS over the whole RBs ...
7
Hierarchical Dataflow Model for Efficient Programming of Clustered Manycore Processors
... complexity and power consumption ...vision algorithms, MPSoCs have now increased their processing capabilities by integrating more and more PEs, a wide variety of memory ar- chitectures, and ...
7
Deriving divide-and-conquer dynamic programming algorithms using solver-aided transformations
... generates efficient C++ code parallelized with Intel Cilk ...computation, and from the types of λ-bound index variable it constructs loops that write to the appropriate ...[20], and figures out the ...
21
Bisimulation Techniques and Algorithms for Concurrent Constraint Programming
... CONTRIBUTIONS AND RELATED WORK 131 ...system and other information needed for the algorithm to ...more efficient class to access the needed ...lists and for each vertex having an inverse ...
155
Computationally Efficient Adaptive Algorithms for Multicarrier Physical Layer
... homogeneity and also respecting the pre-defined girth ...CSI and ‘irregularity’ ...regular and Irregular finite length codes, PEG algorithm significantly improves the performance with respect to ...
192
Efficient Projection Algorithms onto the Weighted 1 Ball
... a fine grain lower bound is defined as a pivot for an efficient splitting (lower bound part). Finally, the algorithm discards on the fly values that are provably not part of S ∗ (online filtering part). Pivot It ...
20
Realistic Models and Efficient Algorithms for Fault Tolerant Scheduling on Heterogeneous Platforms
... significance and usefulness of the CAFT algorithm through simulation ...scheduling algorithms, namely FTSA and ...3]; and (iii) the granularity of the task graph ...2.0] and increments ...
32
Building efficient algorithms by learning to compress
... In addition to our contributions regarding particular problems, we believe this work also contains broader lessons regarding the design of practical algorithms for data analysis. First, our results suggest that, ...
152
Tree-Representation of Set Families in Graph Decompositions and Efficient Algorithms
... divide-and-conquer algorithms could come from the converse of what has just been ...some algorithms, while theoretically efficient, may be notorious for being complicated and ...first ...
211
Truncated Normal Forms for Solving Polynomial Systems: Generalized and Efficient Algorithms
... unstable and hence unfeasible for finite precision ...robust and potentially more e fficient (Mourrain (1999, 2007); Mourrain and Tr´ebuchet (2005, ...Telen and Van Barel (2018) it is shown ...
27
Hybrid Energy-efficient Routing Protocol based on Cuckoo Search and Simulated Annealing algorithms
... simplicity and efficiency in solving combinatorial optimization ...heating and then slowly cooling a substance to obtain a strong crystalline ...careful and slow ...
80
Computationally Efficient Adaptive Algorithms for Multi-carrier Physical Layer
... homogeneity and also respecting the pre-defined girth ...CSI and ‘irregularity’ ...regular and Irregular finite length codes, PEG algorithm significantly improves the performance with respect to ...
192
Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms
... If the area of exact computation is in the heart of combinatorial optimization since the begin- nings of this domain, the main concerns of a large majority of its researchers were rather about the design of clever ...
26
Efficient genetic algorithms for solving hard constrained optimization problems
... (RGA and BGA) sur- pass the standard binary encoded GA ...very efficient on this unimodal problem except clearing, which improves convergence in all ...RTS and DC do not create a sufficient number of ...
4
Efficient algorithms for the Max k-Vertex Cover problem
... of n and c a fixed constant, could ever be devised. In what follows, since there exist many natural parameters for a given problem (e.g., for a graph- problem, the value of an optimal solution, the size of a ...
14