نتایج جستجو برای: where each sub

تعداد نتایج: 1848658  

2011
Antonio Bolufé Röhler Stephen Chen

Particle swarm optimization cannot guarantee convergence to the global optimum on multi-modal functions, so multiple swarms can be useful. One means to coordinate these swarms is to use a separate search mechanism to identify different regions of the solution space for each swarm to explore. The expectation is that these independent subswarms can each perform an effective search around the regi...

For the edge e = uv of a graph G, let nu = n(u|G) be the number of vertices of G lying closer to the vertex u than to the vertex v and nv= n(v|G) can be defined simailarly. Then the ABCGG index of G is defined as ABC...

2011
Dorin Maxim Olivier Buffet Luca Santinelli Liliana Cucu-Grosjean Robert I. Davis

In this paper we investigate the problem of optimal priority assignment in fixed priority pre-emptive single processor systems where tasks have probabilistic execution times. We identify three sub-problems which optimise different metrics related to the probability of deadline failures. For each sub-problem we propose an algorithm that is proved optimal. The first two algorithms are inspired by...

Journal: :The Astrophysical Journal 2023

Abstract In the coldest (10–20 K) regions of interstellar medium, icy surfaces grains serve as solid-state supports for chemical reactions. Among their plausible roles, that third body is advocated, in which reaction energies surface reactions dissipate throughout grain, stabilizing product. This energy dissipation process poorly understood at atomic scale, although it can have a high impact on...

Journal: :Fuzzy Sets and Systems 2013
Enrique de Amo Manuel Díaz Carrillo Juan Fernández-Sánchez

Recently, Durante and Jaworski (2008) [6] have proved that the class of absolutely continuous copulas with a given diagonal section is non-empty in case that the diagonal function is such that the set of points where this coincides with the identity function has null-measure. In this paper, we show that if we consider sub-diagonals (or super-diagonals), then the framework changes. Concretely, f...

Journal: :Robotica 2005
Per Cederberg Magnus Olsson Gunnar Bolmsjö

A task-oriented system structure has been developed. In normal industrial robot programming, the path is created and the process is based on the path. Here a process-focused method is proposed, where a task can be split in sub-tasks, one for each part of the process with similar process-characteristics. By carefully encapsulating the information needed to execute a sub-task, this component can ...

Javad Zolgharnein Leeroy J. Theriot Saeid Amani,

Tow new compound of type [(chelate)2Cu-OH-Cu(chelate)2] X3.nH2O, where chelate=1,10-phenanthroline; X=Cl¯(n=3.5) and chelate=4,4'-dimethyl-2,2'-bipyridine;  (n=5) have been synthesized and their properties investigated. The complexes show room temperature magnetic moment order of 1.0 B.M. per copper atom. The X-band ESR spectrum of powdered sample...

Journal: :Discrete Math., Alg. and Appl. 2009
Rajiv Gandhi Bradford Greening Sriram V. Pemmaraju Rajiv Raman

In this paper, we study the sub-coloring and hypo-coloring problems on interval graphs. These problems have applications in job scheduling and distributed computing and can be used as “subroutines” for other combinatorial optimization problems. In the sub-coloring problem, given a graph G, we want to partition the vertices of G into minimum number of sub-color classes, where each sub-color clas...

2012
Sandeep K. Gupta

In this paper, we propose an efficient method for incorporating the knowledge of global (worst case of on-die, across die, across wafers, and across wafer lots) and local (worst case on-die) process variations into a systematic framework for identifying delay marginalities in a design during first-silicon validation. With the goal of significantly reducing the number of vectors required for val...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید