Relevant bibliographies by topics / Parameterized rules

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Parameterized rules'

Author: Grafiati
Published: 4 June 2021
Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Parameterized rules.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Parameterized rules"

1

Simiński, Krzysztof. "Rule weights in a neuro-fuzzy system with a hierarchical domain partition." International Journal of Applied Mathematics and Computer Science 20, no. 2 (2010): 337–47. http://dx.doi.org/10.2478/v10006-010-0025-3.

Full text
Abstract:
Rule weights in a neuro-fuzzy system with a hierarchical domain partitionThe paper discusses the problem of rule weight tuning in neuro-fuzzy systems with parameterized consequences in which rule weights and the activation of the rules are not interchangeable. Some heuristic methods of rule weight computation in neuro-fuzzy systems with a hierarchical input domain partition and parameterized consequences are proposed. Several heuristics with experimental results showing the advantage of their usage are presented.
APA, Harvard, Vancouver, ISO, and other styles
2

CELLIER, PEGGY, SÉBASTIEN FERRÉ, OLIVIER RIDOUX, and MIREILLE DUCASSÉ. "A PARAMETERIZED ALGORITHM TO EXPLORE FORMAL CONTEXTS WITH A TAXONOMY." International Journal of Foundations of Computer Science 19, no. 02 (2008): 319–43. http://dx.doi.org/10.1142/s012905410800570x.

Full text
Abstract:
Formal Concept Analysis (FCA) is a natural framework to learn from examples. Indeed, learning from examples results in sets of frequent concepts whose extent contains mostly these examples. In terms of association rules, the above learning strategy can be seen as searching the premises of rules where the consequence is set. In its most classical setting, FCA considers attributes as a non-ordered set. When attributes of the context are partially ordered to form a taxonomy, Conceptual Scaling allows the taxonomy to be taken into account by producing a context completed with all attributes deduce
APA, Harvard, Vancouver, ISO, and other styles
3

Fuks, Henryk, and Nino Boccara. "Generalized Deterministic Traffic Rules." International Journal of Modern Physics C 09, no. 01 (1998): 1–12. http://dx.doi.org/10.1142/s0129183198000029.

Full text
Abstract:
We study a family of deterministic models for highway traffic flow which generalize cellular automaton rule 184. This family is parameterized by the speed limit m and another parameter k that represents a "degree of aggressiveness" in driving, strictly related to the distance between two consecutive cars. We compare two driving strategies with identical maximum throughput: "conservative" driving with high speed limit and "aggressive" driving with low speed limit. Those two strategies are evaluated in terms of accident probability. We also discuss fundamental diagrams of generalized traffic rul
APA, Harvard, Vancouver, ISO, and other styles
4

Conchon, Sylvain, Giorgio Delzanno, and Angelo Ferrando. "Declarative Parameterized Verification of Distributed Protocols via the Cubicle Model Checker." Fundamenta Informaticae 178, no. 4 (2021): 347–78. http://dx.doi.org/10.3233/fi-2021-2010.

Full text
Abstract:
We show that Cubicle, an SMT-based infinite-state model checker, can be applied as a verification engine for GLog, a logic-based language based on relational updates rules that has been applied to specify topology-sensitive distributed protocols with asynchronous communication. In this setting, the absence of protocol anomalies can be reduced to a coverability problem in which the initial set of configurations is not fixed a priori (Existential Coverability Problem). Existential Coverability in GLog can naturally be expressed into Parameterized Verification judgements in Cubicle. The encoding
APA, Harvard, Vancouver, ISO, and other styles
5

Gashnikov, M. V. "Parameterized interpolation for fusion of multidimensional signals of various resolutions." Computer Optics 44, no. 3 (2020): 436–40. http://dx.doi.org/10.18287/2412-6179-co-696.

Full text
Abstract:
Parameterized interpolation algorithms are adapted to fusion of multidimensional signals of various resolutions. Interpolating functions, switching rules for them and local features are specified, based on which the interpolating function is selected at each point of the signal. Parameterized interpolation algorithms are optimized based on minimizing the interpolation error. The recurrent interpolator optimization scheme is considered for the situation of inaccessibility of interpolated samples at the stage of setting up the interpolation procedure. Computational experiments are carried out to
APA, Harvard, Vancouver, ISO, and other styles
6

Betzler, N., A. Slinko, and J. Uhlmann. "On the Computation of Fully Proportional Representation." Journal of Artificial Intelligence Research 47 (July 22, 2013): 475–519. http://dx.doi.org/10.1613/jair.3896.

Full text
Abstract:
We investigate two systems of fully proportional representation suggested by Chamberlin Courant and Monroe. Both systems assign a representative to each voter so that the "sum of misrepresentations" is minimized. The winner determination problem for both systems is known to be NP-hard, hence this work aims at investigating whether there are variants of the proposed rules and/or specific electorates for which these problems can be solved efficiently. As a variation of these rules, instead of minimizing the sum of misrepresentations, we considered minimizing the maximal misrepresentation introdu
APA, Harvard, Vancouver, ISO, and other styles
7

RASCHID, LOUIQA, and YA-HUI CHANG. "INTEROPERABLE QUERY PROCESSING FROM OBJECT TO RELATIONAL SCHEMAS BASED ON A PARAMETERIZED CANONICAL REPRESENTATION." International Journal of Cooperative Information Systems 04, no. 01 (1995): 81–120. http://dx.doi.org/10.1142/s0218843095000044.

Full text
Abstract:
In this paper, we develop techniques for interoperable query processing between object and relational schemas. The objective is to pose a query against a local object schema and be able to share information transparently from target relational databases. Our approach is a mapping approach (as opposed to a global schema approach) and is based on using canonical representations (CR). We use one CR for resolving heterogeneity based on the object and relational query languages. We use a second parameterized CR to resolve representational heterogeneity between object and relational schema, and to b
APA, Harvard, Vancouver, ISO, and other styles
8

Whalen, Thomas. "Exact solutions for interacting rules in generalized modus ponens with parameterized implication functions." Information Sciences 92, no. 1-4 (1996): 211–32. http://dx.doi.org/10.1016/0020-0255(96)00050-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Alturbeh, Hamid, and James F. Whidborne. "Visual Flight Rules-Based Collision Avoidance Systems for UAV Flying in Civil Aerospace." Robotics 9, no. 1 (2020): 9. http://dx.doi.org/10.3390/robotics9010009.

Full text
Abstract:
The operation of Unmanned Aerial Vehicles (UAVs) in civil airspace is restricted by the aviation authorities, which require full compliance with regulations that apply for manned aircraft. This paper proposes control algorithms for a collision avoidance system that can be used as an advisory system or a guidance system for UAVs that are flying in civil airspace under visual flight rules. A decision-making system for collision avoidance is developed based on the rules of the air. The proposed architecture of the decision-making system is engineered to be implementable in both manned aircraft an
APA, Harvard, Vancouver, ISO, and other styles
10

Zeinali, Meysar, and Leila Notash. "SYSTEMATIC ADAPTIVE FUZZY LOGIC MODELLING OF COMPLEX SYSTEMS FROM INPUT-OUTPUT DATA." Transactions of the Canadian Society for Mechanical Engineering 29, no. 4 (2005): 569–80. http://dx.doi.org/10.1139/tcsme-2005-0036.

Full text
Abstract:
The complex nonlinear systems, which are difficult to be mathematically modelled, can be described by a fuzzy model. This article attempts to improve and to address the problems concerning the systematic fuzzy-logic modelling of multi-input-muiti-output (MIMO) systems, by introducing the following three concepts. 1) A generalized and parameterized reasoning mechanism constructed based on the weighted sum of the normalized defuzzified output value of each individual rule. Then the crisp outputs of the fuzzy model can be directly calculated from the crisp inputs using the parameterized reasoning
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Parameterized rules"

1

PIRES, Stéfani Silva. "Descoberta de causa-raiz em ocorrências de sistemas elétricos." Universidade Federal de Campina Grande, 2010. http://dspace.sti.ufcg.edu.br:8080/jspui/handle/riufcg/1471.

Full text
Abstract:
Submitted by Johnny Rodrigues (johnnyrodrigues@ufcg.edu.br) on 2018-08-16T13:58:48Z No. of bitstreams: 1 STEFANI SILVA PIRES - DISSERTAÇÃO PGCC 2010..pdf: 819684 bytes, checksum: 625f468cb174d699bf5b98131d1adf61 (MD5)<br>Made available in DSpace on 2018-08-16T13:58:48Z (GMT). No. of bitstreams: 1 STEFANI SILVA PIRES - DISSERTAÇÃO PGCC 2010..pdf: 819684 bytes, checksum: 625f468cb174d699bf5b98131d1adf61 (MD5) Previous issue date: 2010-08-19<br>Este trabalho apresenta uma técnica de análise de causa-raiz para sistemas elétricos de potência. A análise de causa-raiz é uma forma de auxiliar o o
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Parameterized rules"

1

Laver, Michael, and Ernest Sergenti. New Decision Rules, New Rule Features. Princeton University Press, 2017. http://dx.doi.org/10.23943/princeton/9780691139036.003.0007.

Full text
Abstract:
This chapter investigates the implications of having a very large and diverse set of decision rules that any party leader might use. It defines two completely new vote-seeking rule “species.” It also identifies a range of parameterized “features” of all decision rules, such as the “speed” at which party policy is changed, or the extent to which party leaders are “satisfied” with any given vote share. The chapter investigates “only” 111 different decision rules in order to focus on parsimonious models that generate easily interpretable results. These results also give good intuitions about dyna
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Parameterized rules"

1

Kenab, Madani, Tayeb Ould Braham, and Pierre Bazex. "Parameterized Formatting of an XML Document by XSL Rules." In Advances in Information Systems. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30198-1_22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Bártek, Filip, and Martin Suda. "Neural Precedence Recommender." In Automated Deduction – CADE 28. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-79876-5_30.

Full text
Abstract:
AbstractThe state-of-the-art superposition-based theorem provers for first-order logic rely on simplification orderings on terms to constrain the applicability of inference rules, which in turn shapes the ensuing search space. The popular Knuth-Bendix simplification ordering is parameterized by symbol precedence—a permutation of the predicate and function symbols of the input problem’s signature. Thus, the choice of precedence has an indirect yet often substantial impact on the amount of work required to complete a proof search successfully.This paper describes and evaluates a symbol precedence recommender, a machine learning system that estimates the best possible precedence based on observations of prover performance on a set of problems and random precedences. Using the graph convolutional neural network technology, the system does not presuppose the problems to be related or share a common signature. When coupled with the theorem prover Vampire and evaluated on the TPTP problem library, the recommender is found to outperform a state-of-the-art heuristic by more than 4 % on unseen problems.
APA, Harvard, Vancouver, ISO, and other styles
3

Kelly, Tom. "CityEngine: An Introduction to Rule-Based Modeling." In Urban Informatics. Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-15-8983-6_35.

Full text
Abstract:
AbstractCityEngine is a rule-based urban modeling software package. It offers a flexible pipeline to transform 2D data into 3D urban models. Typical applications include processing 2D urban cartographic geographic information system (GIS) data to create a detailed 3D city model, creating a detailed visualization of a proposed development, or exploring the design space of a potential project. The rule-based core of Esri’s CityEngine has some unique advantages: Huge cities can be created as easily as small ones, while the quality of the models is consistent throughout. Additionally, this rule-based approach means that large design spaces can be explored quickly, interactively, and analytically compared. Such advantages must be carefully balanced against the increased time to create and parameterize the rules and the sometimes stylistic or approximate models created; coming from more traditional workflows, CityEngine’s pipeline can be initially overwhelming. We introduce the principal workflows and the flexibility they afford, sketch the procedural programming language used, and discuss the export pathways available.
APA, Harvard, Vancouver, ISO, and other styles
4

Butler, Eric, Emina Torlak, and Zoran Popović. "A Framework for Parameterized Design of Rule Systems Applied to Algebra." In Intelligent Tutoring Systems. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-39583-8_36.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Sonkar, Shailendra Kumar, Vishal Bhatnagar, and Rama Krishna Challa. "A Layered Parameterized Framework for Intelligent Information Retrieval in Dynamic Social Network using Data Mining." In Data Mining and Analysis in the Engineering Field. IGI Global, 2014. http://dx.doi.org/10.4018/978-1-4666-6086-1.ch013.

Full text
Abstract:
Dynamic social networks contain vast amounts of data, which is changing continuously. A search in a dynamic social network does not guarantee relevant, filtered, and timely information to the users all the time. There should be some sequential processes to apply some techniques and store the information internally that provides the relevant, filtered, and timely information to the users. In this chapter, the authors categorize the social network users into different age groups and identify the suitable and appropriate parameters, then assign these parameters to the already categorized age groups and propose a layered parameterized framework for intelligent information retrieval in dynamic social network using different techniques of data mining. The primary data mining techniques like clustering group the different groups of social network users based on similarities between key parameter items and by classifying the different classes of social network users based on differences among key parameter items, and it can be association rule mining, which finds the frequent social network users from the available users.
APA, Harvard, Vancouver, ISO, and other styles
6

Sonkar, Shailendra Kumar, Vishal Bhatnagar, and Rama Krishna Challa. "A Layered Parameterized Framework for Intelligent Information Retrieval in Dynamic Social Network using Data Mining." In Business Intelligence. IGI Global, 2016. http://dx.doi.org/10.4018/978-1-4666-9562-7.ch024.

Full text
Abstract:
Dynamic social networks contain vast amounts of data, which is changing continuously. A search in a dynamic social network does not guarantee relevant, filtered, and timely information to the users all the time. There should be some sequential processes to apply some techniques and store the information internally that provides the relevant, filtered, and timely information to the users. In this chapter, the authors categorize the social network users into different age groups and identify the suitable and appropriate parameters, then assign these parameters to the already categorized age groups and propose a layered parameterized framework for intelligent information retrieval in dynamic social network using different techniques of data mining. The primary data mining techniques like clustering group the different groups of social network users based on similarities between key parameter items and by classifying the different classes of social network users based on differences among key parameter items, and it can be association rule mining, which finds the frequent social network users from the available users.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Parameterized rules"

1

Gupta, Sushmita, Pallavi Jain, Saket Saurabh, and Nimrod Talmon. "Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules." In Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/31.

Full text
Abstract:
Multiwinner elections have proven to be a fruitful research topic with many real world applications. We contribute to this line of research by improving the state of the art regarding the computational complexity of computing good committees. More formally, given a set of candidates C, a set of voters V, each ranking the candidates according to their preferences, and an integer k; a multiwinner voting rule identifies a committee of size k, based on these given voter preferences. In this paper we consider several utilitarian and egailitarian OWA (ordered weighted average) scoring rules, which a
APA, Harvard, Vancouver, ISO, and other styles
2

Boehmer, Niclas, Robert Bredereck, Dušan Knop, and Junjie Luo. "Fine-Grained View on Bribery for Group Identification." 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/10.

Full text
Abstract:
Given a set of individuals qualifying or disqualifying each other, group identification is the task of identifying a socially qualified subgroup of individuals. Social qualification depends on the specific rule used to aggregate individual qualifications. The bribery problem in this context asks how many agents need to change their qualifications in order to change the outcome. Complementing previous results showing polynomial-time solvability or NP-hardness of bribery for various social rules in the constructive (aiming at making specific individuals socially qualified) or destructive (aiming
APA, Harvard, Vancouver, ISO, and other styles
3

Helms, Bergen, Kristina Shea, and Frank Hoisl. "A Framework for Computational Design Synthesis Based on Graph-Grammars and Function-Behavior-Structure." In ASME 2009 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2009. http://dx.doi.org/10.1115/detc2009-86851.

Full text
Abstract:
Computational design synthesis supports the knowledge-intensive process of developing new products. However, most approaches to date are often limited to a narrow domain and viewpoint of a synthesis task. The framework introduced in this paper aims to respond to the need for a method that integrates a richer product representation for computational synthesis within a framework that includes simulation, performance evaluation, and search. A computational and parameterized product model is presented that combines the Function-Behavior-Structure levels of abstraction. Graph-grammars are then used
APA, Harvard, Vancouver, ISO, and other styles
4

Gupta, Sushmita, Pallavi Jain, and Saket Saurabh. "Well-Structured Committees." 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/27.

Full text
Abstract:
In the standard model of committee selection, we are given a set of ordinal votes over a set of candidates and a desired committee size, and the task is to select a committee that relates to the given votes. Motivated by possible interactions and dependencies between candidates, we study a generalization of committee selection in which the candidates are connected via a network and the task is to select a committee that relates to the given votes while also satisfy certain properties with respect to this candidate network. To accommodate certain correspondences to the voter preferences, we con
APA, Harvard, Vancouver, ISO, and other styles
5

Watton, John D., and James R. Rinderle. "A Method to Identify Reformulations of Mechanical Parametric Constraints to Enhance Design." In ASME 1990 Design Technical Conferences. American Society of Mechanical Engineers, 1990. http://dx.doi.org/10.1115/detc1990-0111.

Full text
Abstract:
Abstract The complexity of mechanical design is reflected in the complexity of the design equations which relate functional requirements to design parameters. Reformulations of the design equations can significantly reduce this complexity. This is accomplished by a transformation to alternative design parameters, such as a critical ratio, a nondimensional parameter, or a simple difference; e.g. the ratio of surface area to volume for heat transfer loss, the Reynold’s number in fluid mechanics, or the velocity difference across a fluid coupling. We have developed a method by which the alternati
APA, Harvard, Vancouver, ISO, and other styles
6

Zhang, Jianbing, Yixin Sun, Shujian Huang, et al. "AGRA: An Analysis-Generation-Ranking Framework for Automatic Abbreviation from Paper Titles." In Twenty-Sixth International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/590.

Full text
Abstract:
People sometimes choose word-like abbreviations to refer to items with a long description. These abbreviations usually come from the descriptive text of the item and are easy to remember and pronounce, while preserving the key idea of the item. Coming up with a nice abbreviation is not an easy job, even for human. Previous assistant naming systems compose names by applying hand-written rules, which may not perform well. In this paper, we propose to view the naming task as an artificial intelligence problem and create a data set in the domain of academic naming. To generate more delicate names,
APA, Harvard, Vancouver, ISO, and other styles
7

Münzer, Clemens, Kristina Shea, and Bergen Helms. "Automated Parametric Design Synthesis Using Graph Grammars and Constraint Solving." In ASME 2012 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/detc2012-70313.

Full text
Abstract:
Computational design synthesis aims to support human designers throughout the design process. However, most approaches to date are limited to narrow parts of this process. The approach presented in this paper aims to respond to the need for a method that covers not only single aspects of the design process, but the whole design process from requirements to a dimensioned product concept, i.e. product architecture and related parameters. A generic approach is presented that covers requirements engineering, graph grammar-based concept architecture synthesis and automated parameterization of compo
APA, Harvard, Vancouver, ISO, and other styles
8

Du, Xuehong, Mitchell M. Tseng, and Jianxin Jiao. "Graph Grammar Based Product Variety Modeling." In ASME 2000 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2000. http://dx.doi.org/10.1115/detc2000/dfm-14041.

Full text
Abstract:
Abstract This paper discusses the issue of product variety modeling, i.e. the means to organize the data of a family of products according to the underpinning logic among them. The targeted product families are characterized by providing user-selectable product features and feature values and achieving variety by combining parameterized functional or physical modules. A graph grammar based (GGB) model is proposed for the purpose of enhancing the comprehensiveness and manipulability of the data of product families for different functional departments in a company in order to facilitate effectiv
APA, Harvard, Vancouver, ISO, and other styles
9

Otto, Harald E., Fumihiko Kimura, Ferruccio Mandorli, and Umberto Cugini. "Domain-Oriented Semantics for Feature Modeling Based on TAE Structures Using Conditional Attributed Rewriting Systems." In ASME 1994 International Computers in Engineering Conference and Exhibition and the ASME 1994 8th Annual Database Symposium collocated with the ASME 1994 Design Technical Conferences. American Society of Mechanical Engineers, 1994. http://dx.doi.org/10.1115/cie1994-0385.

Full text
Abstract:
Abstract Requirements of intelligent CAD systems are aimed to enable them to support the designer throughout his/her entire activity, starting from conceptual design and ending with, according to given specifications, an almost complete design object description. Current approaches featuring geometrical constraint-based systems with parametric or variational models, allow the designer to consider the realized design object description as an archetype of a family, based on a unique morphological model with unambiguous sets of parameterized rules. However, functionality for both design and reaso
APA, Harvard, Vancouver, ISO, and other styles
10

Dey, Palash, Neeldhara Misra, Swaprava Nath, and Garima Shakya. "A Parameterized Perspective on Protecting Elections." 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/34.

Full text
Abstract:
We study the parameterized complexity of the optimal defense and optimal attack problems in voting. In both the problems, the input is a set of voter groups (every voter group is a set of votes) and two integers k_a and k_d corresponding to respectively the number of voter groups the attacker can attack and the number of voter groups the defender can defend. A voter group gets removed from the election if it is attacked but not defended. In the optimal defense problem, we want to know if it is possible for the defender to commit to a strategy of defending at most k_d voter groups such that, no
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Parameterized rules' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography