Thematische Bibliographien / Disjunctive graph

Inhaltsverzeichnis

  1. Zeitschriftenartikel
  2. Dissertationen
  3. Buchteile
  4. Konferenzberichte

Auswahl der wissenschaftlichen Literatur zum Thema „Disjunctive graph“

Autor: Grafiati
Veröffentlicht am 4. Juni 2021
Zuletzt aktualisiert am 10. Februar 2022

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Disjunctive graph" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "Disjunctive graph"

1

Azari, M., and A. Iranmanesh. "On the edge-Wiener index of the disjunctive product of simple graphs." Algebra and Discrete Mathematics 30, no. 1 (2020): 1–14. http://dx.doi.org/10.12958/adm242.

Der volle Inhalt der Quelle
Annotation:
The edge-Wiener index of a simple connected graph G is defined as the sum of distances between all pairs of edges of G where the distance between two edges in G is the distance between the corresponding vertices in the line graph of G. In this paper, we study the edge-Wiener index under the disjunctive product of graphs and apply our results to compute the edge-Wiener index for the disjunctive product of paths and cycles.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Yi, Eunjeong. "Disjunctive total domination in permutation graphs." Discrete Mathematics, Algorithms and Applications 09, no. 01 (2017): 1750009. http://dx.doi.org/10.1142/s1793830917500094.

Der volle Inhalt der Quelle
Annotation:
Let [Formula: see text] be a graph with vertex set [Formula: see text] and edge set [Formula: see text]. If [Formula: see text] has no isolated vertex, then a disjunctive total dominating set (DTD-set) of [Formula: see text] is a vertex set [Formula: see text] such that every vertex in [Formula: see text] is adjacent to a vertex of [Formula: see text] or has at least two vertices in [Formula: see text] at distance two from it, and the disjunctive total domination number [Formula: see text] of [Formula: see text] is the minimum cardinality overall DTD-sets of [Formula: see text]. Let [Formula: see text] and [Formula: see text] be two disjoint copies of a graph [Formula: see text], and let [Formula: see text] be a bijection. Then, a permutation graph [Formula: see text] has the vertex set [Formula: see text] and the edge set [Formula: see text]. For any connected graph [Formula: see text] of order at least three, we prove the sharp bounds [Formula: see text]; we give an example showing that [Formula: see text] can be arbitrarily large. We characterize permutation graphs for which [Formula: see text] holds. Further, we show that [Formula: see text] when [Formula: see text] is a cycle, a path, and a complete [Formula: see text]-partite graph, respectively.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Goddard, Wayne, Michael A. Henning, and Charles A. McPillan. "The disjunctive domination number of a graph." Quaestiones Mathematicae 37, no. 4 (2014): 547–61. http://dx.doi.org/10.2989/16073606.2014.894688.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Wang, Jin Feng, Kai Yu Chu, and Qing Yu Wang. "An Approach of Process Planning Using Ant Colony Optimization Algorithm." Advanced Materials Research 978 (June 2014): 209–12. http://dx.doi.org/10.4028/www.scientific.net/amr.978.209.

Der volle Inhalt der Quelle
Annotation:
An ant colony optimization (ACO) approach has been developed to deal with process planning problem to achieve the optimal process plan. A disjunctive weighted directed graph is conducted to describe the operations, precedence constraints between operations, and the possible visited path between operation nodes. A represent of process plan is described based on the disjunctive weighted directed graph. Ant colony goes through the necessary nodes on the graph to achieve the optimal solution with the objective of minimizing Total Production Costs (TPC). Extensive comparative experiments have been carried out to demonstrate the feasibility and efficiency of the proposed approach.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Tran Van, Dinh, Alessandro Sperduti, and Fabrizio Costa. "The conjunctive disjunctive graph node kernel for disease gene prioritization." Neurocomputing 298 (July 2018): 90–99. http://dx.doi.org/10.1016/j.neucom.2018.01.089.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Zhao, Jing Jing, and Yong Ming Yang. "A Novel Algorithm for Action Landmarks Extraction." Advanced Materials Research 659 (January 2013): 97–102. http://dx.doi.org/10.4028/www.scientific.net/amr.659.97.

Der volle Inhalt der Quelle
Annotation:
In this work, we present a new algorithm for extracting action landmarks from proposition landmarks graph. Compared to published approaches, the action landmarks extraction algorithm we proposed can find more disjunctive action landmarks and single action landmarks. We illustrate our ideas with experiments among benchmark domains. The experiments show that the new algorithm is competitive with traditional algorithm for finding action landmarks from relaxed plan graph.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Pottosin, Yu V. "Minimization of Boolean functions in the class of orthogonal disjunctive normal forms." Informatics 18, no. 2 (2021): 33–47. http://dx.doi.org/10.37661/1816-0301-2021-18-2-33-47.

Der volle Inhalt der Quelle
Annotation:
The orthogonal disjunctive normal forms (DNFs) of Boolean functions have wide applications in the logical design of discrete devices. The problem of DNF orthogonalization is to get for a given function such a DNF that any two its terms would be orthogonal, i. e. the conjunction of them would be equal identically to zero. An approach to solve the problem using the means of graph theory is suggested. The approach is proposed by representation of the function as perfect DNF. Obtaining all the intervals of the Boolean space where the given function has value 1 is supposed, and the intersection graph of those intervals is considered. Two methods to obtain a minimum orthogonal DNF are considered. One of them reduces the problem toward finding out the smallest dominating set in the graph by covering its vertices with their closed neighborhoods, the other - to obtain the maximum independent set by lexicographic enumeration. It is shown how the suggested approach can be extended on incompletely specified Boolean functions.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Błażewicz, Jacek, Erwin Pesch, and Małgorzata Sterna. "The disjunctive graph machine representation of the job shop scheduling problem." European Journal of Operational Research 127, no. 2 (2000): 317–31. http://dx.doi.org/10.1016/s0377-2217(99)00486-5.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Aguilera, Néstor E., Mariana S. Escalante, and Graciela L. Nasini. "A Generalization of the Perfect Graph Theorem Under the Disjunctive Index." Mathematics of Operations Research 27, no. 3 (2002): 460–69. http://dx.doi.org/10.1287/moor.27.3.460.309.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Burdett, R. L., and E. Kozan. "A disjunctive graph model and framework for constructing new train schedules." European Journal of Operational Research 200, no. 1 (2010): 85–98. http://dx.doi.org/10.1016/j.ejor.2008.12.005.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Dissertationen zum Thema "Disjunctive graph"

1

Kašpar, Michal. "Theory and practice of manufacturing scheduling." Master's thesis, Vysoká škola ekonomická v Praze, 2008. http://www.nusl.cz/ntk/nusl-12435.

Der volle Inhalt der Quelle
Annotation:
Manufactural activity is the basis of every sound economy. The risk for today's industrial establishments in our let us say european conditions is to hold competitiveness in the terms of global economy. This diploma thesis is focusing on solving problems of manufacturing scheduling with the view of theory and practice. It is impeach of real-life production. Scheduling belongs to hard combinatorial problems and therefore are usually solved by various heuristic or metaheuristic methods. For application of mentioned metaheuristic methods is important to use suitable choice of representative data.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Heitmann, Silvia. "Job-shop scheduling with limited buffer capacities." Doctoral thesis, Saarbrücken VDM Verlag Dr. Müller, 2007. https://repositorium.ub.uni-osnabrueck.de/handle/urn:nbn:de:gbv:700-2007072013.

Der volle Inhalt der Quelle
Annotation:
In this work, we investigate job-shop problems where limited capacity buffers to store jobs in non-processing periods are present. In such a problem setting, after finishing processing on a machine, a job either directly has to be processed on the following machine or it has to be stored in a prespecified buffer. If the buffer is completely occupied the job may wait on its current machine but blocks this machine for other jobs. Besides a general buffer model,also specific configurations are considered.The key issue to develop fast heuristics for the job-shop problem with buffers is to find a compact representation of solutions. In contrast to the classical job-shop problem,where a solution may be given by the sequences of the jobs on the machines, now also the buffers have to be incorporated in the solution representation. In this work, we propose two solution representations for the job-shop problem with buffers. Furthermore, we investigate whether the given solution representations can be simplified for specific buffer configurations. For the general buffer configuration it is shown that an incorporation of the buffers in the solution representation is necessary, whereas for specific buffer configurations possible simplifications are presented. Based on the given solution representations we develop local search heuristics in the second part of this work. Therefore, the well-known block approach for the classical job-shop problem is generalized to the job-shop problem with specific buffer configurations.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Larabi, Mohand. "Le problème de job-shop avec transport : modélisation et optimisation." Phd thesis, Université Blaise Pascal - Clermont-Ferrand II, 2010. http://tel.archives-ouvertes.fr/tel-00625528.

Der volle Inhalt der Quelle
Annotation:
Dans cette thèse nous nous sommes intéressés à l'extension du problème job-shop en ajoutant la contrainte du transport des jobs entre les différentes machines. Dans cette étude nous avons retenu l'existence de deux types de robots, les robots de capacité de chargement unitaire (capacité=1 veut dire qu'un robot ne peut transporter qu'un seul job à la fois) et les robots de capacité de chargement non unitaire (capacité>1 veut dire qu'un robot peut transporter plusieurs job à la fois). Nous avons traité cette extension en deux étapes. Ainsi, la première étape est consacrée au problème du job-shop avec plusieurs robots de capacité de chargement unitaire et en seconde étape en ajoutant la capacité de chargement non unitaire aux robots. Pour les deux problèmes étudiés nous avons proposé :* Une modélisation linéaire ;* Une modélisation sous forme de graphe disjonctif ;* Plusieurs heuristiques de construction de solutions ;* Plusieurs recherches locales qui améliorent les solutions obtenues ;* Utilisation des algorithmes génétiques / mémétiques comme schéma global d'optimisation ;* De nouveaux benchmarks, des résultats de test de nos approches sur nos benchmarks et ceux de la littérature et ces résultats sont commentés et comparés à ceux de la littérature. Les résultats obtenus montrent la pertinence de notre modélisation ainsi que sa qualité.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Knopp, Sebastian. "Complex Job-Shop Scheduling with Batching in Semiconductor Manufacturing." Thesis, Lyon, 2016. http://www.theses.fr/2016LYSEM014/document.

Der volle Inhalt der Quelle
Annotation:
La prise en compte de machines à traitement par batch dans les problèmes d’ordonnancement d’ateliers complexes de type job-shop est particulièrement difficile. La fabrication de semiconducteurs est probablement l’une des applications pratiques les plus importantes pour ce types de problèmes. Nous considérons un problème d’ordonnancement de type job-shop flexible avec « p-batching », des flux rentrants, des temps de préparation dépendant de la séquence et des dates de début au plus tôt. Le but c’est d’optimiser différentes fonctions objectives régulières.Les approches existantes par graphe disjonctif pour ce problème utilise des nœuds dédiés pour représenter explicitement les batches. Afin de faciliter la modification du graphe conjonctif, notre nouvelle modélisation réduit cette complexité en modélisant les décisions de batching à travers les poids des arcs. Une importante contribution de cette thèse est un algorithme original qui prend les décisions de batching lors du parcours du graphe. Cet algorithme est complété par un déplacement (« move ») intégré qui permet de reséquencer ou réaffecter les opérations. Cette combinaison donne un voisinage riche que nous appliquons dans une approche méta-heuristique de type GRASP.Nous étendons cette approche en prenant en compte de nouvelles contraintes qui ont un rôle important dans l’application industrielle considérée. En particulier, nous modélisons de manière explicite les ressources internes des machines, et nous considérons un temps maximum d’attente entre deux opérations quelconques d’une gamme de fabrication. Les résultats numériques sur des instances de la littérature pour des problèmes plus simples ainsi que sur de nouvelles instances montrent la généricité et l’applicabilité de notre approche. Notre nouvelle modélisation permet de faciliter les extensions à d’autres contraintes complexes rencontrées dans les applications industrielles<br>The integration of batching machines within a job-shop environment leads to a complex job-shop scheduling problem. Semiconductor manufacturing presumably represents one of the most prominent practical applications for such problems. We consider a flexible job-shop scheduling problem with p-batching, reentrant flows, sequence dependent setup times and release dates while considering different regular objective functions. The scheduling of parallel batching machines and variants of the job-shop scheduling problem are well-studied problems whereas their combination is rarely considered.Existing disjunctive graph approaches for this combined problem rely on dedicated nodes to explicitly represent batches. To facilitate modifications of the graph, our new modeling reduces this complexity by encoding batching decisions into edge weights. An important contribution is an original algorithm that takes batching decisions “on the fly” during graph traversals. This algorithm is complemented by an integrated move to resequence and reassign operations. This combination yields a rich neighborhood that we apply within a GRASP based metaheuristic approach.We extend this approach by taking further constraints into account that are important in the considered industrial application. In particular, we model internal resources of machines in detail and take maximum time lag constraints into account. Numerical results for benchmark instances of different problem types show the generality and applicability of our approach. The conciseness of our idea facilitates extensions towards further complex constraints needed in real-world applications
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Zhang, Qiao. "Contribution à l'ordonnancement d'ateliers avec ressources de transports." Phd thesis, Université de Technologie de Belfort-Montbeliard, 2012. http://tel.archives-ouvertes.fr/tel-00909927.

Der volle Inhalt der Quelle
Annotation:
Nos travaux concernent l'étude d'une extension d'un problème d'ordonnancement bien connu sous l'appellation job shop. Nous appelons cette extension le General Flexible Job Shop Scheduling Problem (GFJSSP). Celui-ci se rencontre dans différents types d'ateliers ayant comme caractéristique commune d'être soumis à des contraintes dues à des ressources de transport. Le GFJSSP se caractérise par l'intégration de machines et robots flexibles. Le terme General induit par ailleurs la présence de robots dont la capacité est supposée unitaire dans notre étude, des temps opératoires bornés, et la possibilité de prise en compte d'emplacements de stockage spécifiques. Après avoir défini l'atelier et le problème correspondant à cette extension, nous avons proposé deux modélisations du GFJSSP ainsi défini : une première modélisation mathématique linéaire, et une modélisation graphique, qui correspond à une généralisation du graphe disjonctif couramment utilisé pour les problèmes de job shop. Nous avons ensuite abordé la résolution suivant deux étapes : tout d'abord en nous focalisant sur l'aspect séquencement des tâches de traitement et de transport, pour lequel nous avons élaboré deux méthodes heuristiques (de type Tabou et basée sur une procédure de shifting bottleneck améliorée) ; puis en intégrant dans un deuxième temps la problématique de l'affectation induite par la flexibilité de certaines ressources. Pour cette dernière étape, nous avons combiné les méthodes précédentes avec un algorithme génétique. L'algorithme hybride obtenu nous permet de résoudre des instances de la littérature correspondant à divers cas spécifiques, avec des résultats assez proches des meilleures méthodes dédiées. A termes, il pourrait être intégré dans un système d'aide à la décision général qui s'affranchirait de la phase d'identification préalable du type de job shop considéré, et serait adapté à la résolution de nombreux cas (avec ou sans problème d'affectation, temps de traitement fixes ou bornés, avec ou sans stockage, etc..).
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

"Disjunctive domination in graphs." Thesis, 2015. http://hdl.handle.net/10210/13871.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Hsu, Chi-Ming, and 許啟明. "A Study on Semiconductor Manufacturing Scheduling Problems with Job Reentrant and Machine Group Constraints---Disjunctive Graph Models." Thesis, 1997. http://ndltd.ncl.edu.tw/handle/62760659733603689279.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Xu, Qi-Ming, and 許啟明. "A Study on Semiconductor Manufacturing Scheduling Problems with Job Reentrant and Machine Group Constraints---Disjunctive Graph Models." Thesis, 1997. http://ndltd.ncl.edu.tw/handle/27358287864871766986.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Wu, Sheng-Fu, and 吳升福. "A Study of disjunctive total domination in claw-free graphs." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/60889029005038313770.

Der volle Inhalt der Quelle
Annotation:
碩士<br>國立東華大學<br>資訊工程學系<br>103<br>Total dominating set is a subset D of V for a graph G = (V;E) such that every vertex is adjacent to at least one member of D. Total dominating number of a graph G, denoted by t(G), is the size of a minimum total dominating set of G. Disjunctive total dominating set is a subset D of V for a graph G = (V;E) such that every vertex of G is adjacent to at least one member of D or there are two vertices of distance 2 in D. Disjunctive total dominating number of a graph G, denoted by dt (G), is the size of a minimum disjunctive total dominating set of vertices in G. By the denition, dt(G)<t(G). A claw-free graph is a graph that does not contain K1;3 as an induced subgraph. It is known that if G is a claw-free graph of order n with minimum degree two, then t(G) (n+2)=2. In this thesis, we show that if G is a connected claw-free graph of order n with minimum degree two, then dt (G) <=2n/5+ 2.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Yang, Hong-Ding, and 楊弘鼎. "A Study of Disjunctive Total domination Problem on Tori and Grid Graphs." Thesis, 2017. http://ndltd.ncl.edu.tw/handle/jm4gu6.

Der volle Inhalt der Quelle
Annotation:
碩士<br>國立東華大學<br>資訊工程學系<br>105<br>For a graph G = (V;E), a subset D of V is a total dominating set of G if every vertex in V has to be adjacent to a vertex of D. Vertex subset D is a disjunctive total dominating set if every vertex of V is adjacent to a vertex of D or has at least two vertices in D at distance 2 from it. The disjunctive total domination problem on G is to find a disjunctive total dominating set D of the minimum cardinality. The cardinality of a minimum disjunctive total dominating set of G is called the disjunctive total domination number of G. In this thesis, we study the disjunctive total domination problem on grid graphs and tori. We propose upper bounds for general grid graphs and tori. In particular, some bounds are optimal for some special cases.
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Buchteile zum Thema "Disjunctive graph"

1

Ovacik, Irfan M., and Reha Uzsoy. "Modelling Interactions Between Subproblems: The Disjunctive Graph Representation and Extensions." In Decomposition Methods for Complex Factory Scheduling Problems. Springer US, 1997. http://dx.doi.org/10.1007/978-1-4615-6329-7_4.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Blazewicz, J., E. Pesch, and M. Sterna. "Extension of Disjunctive Graph Model for Job Shop Scheduling Problem." In Operations Research Proceedings 2000. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/978-3-642-56656-1_57.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Yi, Eunjeong. "The Disjunctive Bondage Number and the Disjunctive Total Bondage Number of Graphs." In Combinatorial Optimization and Applications. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-26626-8_48.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Panda, B. S., Arti Pandey, and S. Paul. "Algorithmic Aspects of Disjunctive Domination in Graphs." In Lecture Notes in Computer Science. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-21398-9_26.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Lin, Chin-Fu, and Sheng-Lung Peng. "Algorithmic Aspects of Disjunctive Total Domination in Graphs." In Combinatorial Optimization and Applications. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-48749-6_21.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Pandey, Arti, and B. S. Panda. "b-Disjunctive Total Domination in Graphs: Algorithm and Hardness Results." In Algorithms and Discrete Applied Mathematics. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-29221-2_24.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Sarkar, Anirban. "Design of Semi-Structured Database System." In Designing, Engineering, and Analyzing Reliable and Efficient Software. IGI Global, 2013. http://dx.doi.org/10.4018/978-1-4666-2958-5.ch005.

Der volle Inhalt der Quelle
Annotation:
The chapter focuses on a graph – semantic based conceptual data model for semi-structured data, called Graph Object Oriented Semi-Structured Data Model (GOOSSDM), to conceptualize the different facets of such system in object oriented paradigm. The model defines a set of graph based formal constructs, varieties of relationship types with participation constraints. It is accompanied with a rich set of graphical notations and those are used to specify the conceptual level design of semi-structured database system. The approach facilitates modeling of irregular, heterogeneous, hierarchical, and non-hierarchical semi-structured data at the conceptual level. The GOOSSDM is also able to represent the mixed content in semi-structured data. Moreover, the approach is capable to model XML document at conceptual level with the facility of document-centric design, ordering and disjunction characteristic. The chapter also includes a rule based transformation mechanism for GOOSSDM schema into the equivalent XML Schema Definition (XSD). Moreover, the chapter also provides comparative study of several similar kinds of proposals for semi-structured data models based on the properties of semi-structured data and future research scope in this area.
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Disjunctive graph"

1

Uchacz, Waldemar. "Using the disjunctive graph for vessel scheduling." In 2016 21st International Conference on Methods and Models in Automation and Robotics (MMAR). IEEE, 2016. http://dx.doi.org/10.1109/mmar.2016.7575190.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Liu, Yuechang, Hong Qian, and Yunfei Jiang. "Graph-DTP: Graph-Based Algorithm for Solving Disjunctive Temporal Problems." In 14th International Symposium on Temporal Representation and Reasoning (TIME'07). IEEE, 2007. http://dx.doi.org/10.1109/time.2007.50.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Seda, Milos, Pavel Seda, and Jindriska Sedova. "Job Shop Scheduling and Its Fuzzification Based on Operations and Disjunctive Graph Representations." In 2019 11th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT). IEEE, 2019. http://dx.doi.org/10.1109/icumt48472.2019.8971003.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Li, Zhongyang, Xiao Ding, Ting Liu, J. Edward Hu, and Benjamin Van Durme. "Guided Generation of Cause and Effect." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/502.

Der volle Inhalt der Quelle
Annotation:
We present a conditional text generation framework that posits sentential expressions of possible causes and effects. This framework depends on two novel resources we develop in the course of this work: a very large-scale collection of English sentences expressing causal patterns (CausalBank); and a refinement over previous work on constructing large lexical causal knowledge graphs (Cause Effect Graph). Further, we extend prior work in lexically-constrained decoding to support disjunctive positive constraints. Human assessment confirms that our approach gives high-quality and diverse outputs. Finally, we use CausalBank to perform continued training of an encoder supporting a recent state-of-the-art model for causal reasoning, leading to a 3-point improvement on the COPA challenge set, with no change in model architecture.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Louaqad, Saad, and Oulaid Kamach. "A disjunctive graph for the Job Shop Problem with Transport and blocking no wait constraints." In 2018 International Colloquium on Logistics and Supply Chain Management (LOGISTIQUA). IEEE, 2018. http://dx.doi.org/10.1109/logistiqua.2018.8428274.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Uchacz, Waldemar. "Comparison of the disjunctive graph model with the MILP class model for vessel scheduling applications." In 2016 21st International Conference on Methods and Models in Automation and Robotics (MMAR). IEEE, 2016. http://dx.doi.org/10.1109/mmar.2016.7575191.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Surynek, Pavel. "Unifying Search-based and Compilation-based Approaches to Multi-agent Path Finding through Satisfiability Modulo Theories." In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/164.

Der volle Inhalt der Quelle
Annotation:
We unify search-based and compilation-based approaches to multi-agent path finding (MAPF) through satisfiability modulo theories (SMT). The task in MAPF is to navigate agents in an undirected graph to given goal vertices so that they do not collide. We rephrase Conflict-Based Search (CBS), one of the state-of-the-art algorithms for optimal MAPF solving, in the terms of SMT. This idea combines SAT-based solving known from MDD-SAT, a SAT-based optimal MAPF solver, at the low-level with conflict elimination of CBS at the high-level. Where the standard CBS branches the search after a conflict, we refine the propositional model with a disjunctive constraint. Our novel algorithm called SMT-CBS hence does not branch at the high-level but incrementally extends the propositional model. We experimentally compare SMT-CBS with CBS, ICBS, and MDD-SAT.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Nguyen, Kim-Ngan T., Marc Plantevit, and Jean-Francois Boulicaut. "Mining Disjunctive Rules in Dynamic Graphs." In Communication Technologies, Research, Innovation, and Vision for the Future (RIVF). IEEE, 2012. http://dx.doi.org/10.1109/rivf.2012.6169829.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Lin, Chin-Fu, Sheng-Lung Peng, and Hong-Ding Yang. "Disjunctive Total Domination Numbers of Grid Graphs." In 2016 International Computer Symposium (ICS). IEEE, 2016. http://dx.doi.org/10.1109/ics.2016.0024.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!

Zur Bibliographie