Academic literature on the topic 'Combinatorics and optimization of evaluation schemes'

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 'Combinatorics and optimization of evaluation schemes.'

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 "Combinatorics and optimization of evaluation schemes"

1

Flerova, Natalia, Radu Marinescu, and Rina Dechter. "Searching for the M Best Solutions in Graphical Models." Journal of Artificial Intelligence Research 55 (April 12, 2016): 889–952. http://dx.doi.org/10.1613/jair.4985.

Full text
Abstract:
The paper focuses on finding the m best solutions to combinatorial optimization problems using best-first or depth-first branch and bound search. Specifically, we present a new algorithm m-A*, extending the well-known A* to the m-best task, and for the first time prove that all its desirable properties, including soundness, completeness and optimal efficiency, are maintained. Since best-first algorithms require extensive memory, we also extend the memory-efficient depth-first branch and bound to the m-best task. We adapt both algorithms to optimization tasks over graphical models (e.g., Weight
APA, Harvard, Vancouver, ISO, and other styles
2

Lam, William, Kalev Kask, Javier Larrosa, and Rina Dechter. "Residual-Guided Look-Ahead in AND/OR Search for Graphical Models." Journal of Artificial Intelligence Research 60 (October 20, 2017): 287–346. http://dx.doi.org/10.1613/jair.5475.

Full text
Abstract:
We introduce the concept of local bucket error for the mini-bucket heuristics and show how it can be used to improve the power of AND/OR search for combinatorial optimization tasks in graphical models (e.g. MAP/MPE or weighted CSPs). The local bucket error illuminates how the heuristic errors are distributed in the search space, guided by the mini-bucket heuristic. We present and analyze methods for compiling the local bucket-errors (exactly and approximately) and show that they can be used to yield an effective tool for balancing look-ahead overhead during search. This can be especially instr
APA, Harvard, Vancouver, ISO, and other styles
3

Zaidi, Bizzat Hussain, Ihsan Ullah, Musharraf Alam, et al. "Incentive Based Load Shedding Management in a Microgrid Using Combinatorial Auction with IoT Infrastructure." Sensors 21, no. 6 (2021): 1935. http://dx.doi.org/10.3390/s21061935.

Full text
Abstract:
This paper presents a novel incentive-based load shedding management scheme within a microgrid environment equipped with the required IoT infrastructure. The proposed mechanism works on the principles of reverse combinatorial auction. We consider a region of multiple consumers who are willing to curtail their load in the peak hours in order to gain some incentives later. Using the properties of combinatorial auctions, the participants can bid in packages or combinations in order to maximize their and overall social welfare of the system. The winner determination problem of the proposed combina
APA, Harvard, Vancouver, ISO, and other styles
4

Mosa, Ahmed A., Aisha H. Abdalla, and Rashid A. Saeed. "Evaluation of MANEMO route optimization schemes." Journal of Network and Computer Applications 35, no. 5 (2012): 1454–72. http://dx.doi.org/10.1016/j.jnca.2012.02.001.

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

Welz, C., B. Srinivasan, and D. Bonvin. "EVALUATION OF MEASUREMENT-BASED OPTIMIZATION SCHEMES FOR BATCH DISTILLATION." IFAC Proceedings Volumes 35, no. 1 (2002): 339–44. http://dx.doi.org/10.3182/20020721-6-es-1901.00625.

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

Wu, Li Ping, and Chun Ping Pang. "National Economic Evaluation Model about Urban Public Transportation Structure Optimization." Applied Mechanics and Materials 610 (August 2014): 1050–52. http://dx.doi.org/10.4028/www.scientific.net/amm.610.1050.

Full text
Abstract:
Public transportation structure optimization makes the contribution to the national economy and also pays the price for it. We established national economic evaluation model about urban public transportation structure optimization using mutually exclusive combination schemes. The research can give effective guidance on the optimal decision for combination schemes of different transportation structure.
APA, Harvard, Vancouver, ISO, and other styles
7

Otten, Lars, and Rina Dechter. "AND/OR Branch-and-Bound on a Computational Grid." Journal of Artificial Intelligence Research 59 (July 17, 2017): 351–435. http://dx.doi.org/10.1613/jair.5456.

Full text
Abstract:
We present a parallel AND/OR Branch-and-Bound scheme that uses the power of a computational grid to push the boundaries of feasibility for combinatorial optimization. Two variants of the scheme are described, one of which aims to use machine learning techniques for parallel load balancing. In-depth analysis identifies two inherent sources of parallel search space redundancies that, together with general parallel execution overhead, can impede parallelization and render the problem far from embarrassingly parallel. We conduct extensive empirical evaluation on hundreds of CPUs, the first of its
APA, Harvard, Vancouver, ISO, and other styles
8

Núñez, Alfredo, Carlos Ocampo-Martinez, José María Maestre, and Bart De Schutter. "Time-Varying Scheme for Noncentralized Model Predictive Control of Large-Scale Systems." Mathematical Problems in Engineering 2015 (2015): 1–17. http://dx.doi.org/10.1155/2015/560702.

Full text
Abstract:
The noncentralized model predictive control (NC-MPC) framework in this paper refers to any distributed, hierarchical, or decentralized model predictive controller (or a combination of them) the structure of which can change over time and the control actions of which are not obtained based on a centralized computation. Within this framework, we propose suitable online methods to decide which information is shared and how this information is used between the different local predictive controllers operating in a decentralized, distributed, and/or hierarchical way. Evaluating all the possible stru
APA, Harvard, Vancouver, ISO, and other styles
9

Hua, B., Q. Yin, and G. Wu. "Energy Optimization Through Exergy-Economic Evaluation." Journal of Energy Resources Technology 111, no. 3 (1989): 148–53. http://dx.doi.org/10.1115/1.3231416.

Full text
Abstract:
This paper deals with total system optimization for energy use in complex process systems based on the premise that the sub-systems or local schemes have been optimally designed. The problem, however, has not been solved so far. Based on the three-links-model established for the energy structure of process systems, this paper advances an evolving optimization strategy, in which the results of quantitative exergy-economic evaluation of the sub-systems are taken as the criteria to guide trade-off among them and lead the total scheme gradually towards optimum. The general concepts, evaluation equ
APA, Harvard, Vancouver, ISO, and other styles
10

Diwold, Konrad, Andrej Aderhold, Alexander Scheidler, and Martin Middendorf. "Performance evaluation of artificial bee colony optimization and new selection schemes." Memetic Computing 3, no. 3 (2011): 149–62. http://dx.doi.org/10.1007/s12293-011-0065-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Combinatorics and optimization of evaluation schemes"

1

Mouilleron, Christophe. "Efficient computation with structured matrices and arithmetic expressions." Phd thesis, Ecole normale supérieure de lyon - ENS LYON, 2011. http://tel.archives-ouvertes.fr/tel-00688388.

Full text
Abstract:
Designing efficient code in practice for a given computation is a hard task. In this thesis, we tackle this issue in two different situations. The first part of the thesis introduces some algorithmic improvements in structured linear algebra. We first show how to extend an algorithm by Cardinal for inverting Cauchy-like matrices to the other common structures. This approach, which mainly relies on products of the type "structured matrix × matrix", leads to a theoretical speed-up of a factor up to 7 that we also observe in practice. Then, we extend some works on Toeplitz-like matrices and prove
APA, Harvard, Vancouver, ISO, and other styles
2

Fan, Jiahua. "Development of Image Display-Specific Evaluation and Optimization Schemes." Diss., The University of Arizona, 2006. http://hdl.handle.net/10150/195754.

Full text
Abstract:
An electronic display is typically the last stage of an imaging chain before the human observer. Some of its physical properties can make it a bottleneck in the chain. This dissertation is an attempt to study and cope with certain critical properties of electronic displays, specifically spatial resolution, noise and contrast. The focus of this study lies in two parts. One is the measurement and estimation of display properties, including the spatial resolution and the spatial noise. The other is on the development of display-based image processing algorithms, which can compensate for the degra
APA, Harvard, Vancouver, ISO, and other styles
3

He, Jian. "Design and Evaluation of a Data-distributed Massively Parallel Implementation of a Global Optimization Algorithm---DIRECT." Diss., Virginia Tech, 2007. http://hdl.handle.net/10919/29786.

Full text
Abstract:
The present work aims at an efficient, portable, and robust design of a data-distributed massively parallel DIRECT, the deterministic global optimization algorithm widely used in multidisciplinary engineering design, biological science, and physical science applications. The original algorithm is modified to adapt to different problem scales and optimization (exploration vs.\ exploitation) goals. Enhanced with a memory reduction technique, dynamic data structures are used to organize local data, handle unpredictable memory requirements, reduce the memory usage, and share the data across multi
APA, Harvard, Vancouver, ISO, and other styles
4

Mullin, Natalie Ellen. "Uniform Mixing of Quantum Walks and Association Schemes." Thesis, 2013. http://hdl.handle.net/10012/7918.

Full text
Abstract:
In recent years quantum algorithms have become a popular area of mathematical research. Farhi and Gutmann introduced the concept of a quantum walk in 1998. In this thesis we investigate mixing properties of continuous-time quantum walks from a mathematical perspective. We focus on the connections between mixing properties and association schemes. There are three main goals of this thesis. Our primary goal is to develop the algebraic groundwork necessary to systematically study mixing properties of continuous-time quantum walks on regular graphs. Using these tools we achieve two additional go
APA, Harvard, Vancouver, ISO, and other styles
5

Swanson, Colleen Marie. "Security in Key Agreement: Two-Party Certificateless Schemes." Thesis, 2008. http://hdl.handle.net/10012/4156.

Full text
Abstract:
The main goal of cryptography is to enable secure communication over a public channel; often a secret shared among the communicating parties is used to achieve this. The process by which these parties agree on such a shared secret is called key agreement. In this thesis, we focus on two-party key agreement protocols in the public-key setting and study the various methods used to establish and validate public keys. We pay particular attention to certificateless key agreement schemes and attempt to formalize a relevant notion of security. To that end, we give a possible extension of the existing
APA, Harvard, Vancouver, ISO, and other styles
6

Knapp, Edward. "On Pairing-Based Signature and Aggregate Signature Schemes." Thesis, 2008. http://hdl.handle.net/10012/4208.

Full text
Abstract:
In 2001, Boneh, Lynn, and Shacham presented a pairing-based signature scheme known as the BLS signature scheme. In 2003, Boneh, Gentry, Lynn, and Shacham presented the first aggregate signature scheme called the BGLS aggregate signature scheme. The BGLS scheme allows for N users with N signatures to combine their signatures into a single signature. The size of the resulting signature is independent of N. The BGLS signature scheme enjoys roughly the same level of security as the BLS scheme. In 2005, Waters presented a pairing-based signature scheme which does not assume the existence of rand
APA, Harvard, Vancouver, ISO, and other styles
7

Ustaoglu, Berkant. "Key establishment --- security models, protocols and usage." Thesis, 2008. http://hdl.handle.net/10012/3827.

Full text
Abstract:
Key establishment is the process whereby two or more parties derive a shared secret, typically used for subsequent confidential communication. However, identifying the exact security requirements for key establishment protocols is a non-trivial task. This thesis compares, extends and merges existing security definitions and models for key establishment protocols. The primary focus is on two-party key agreement schemes in the public-key setting. On one hand new protocols are proposed and analyzed in the existing Canetti-Krawzcyk model. On the other hand the thesis develops a security model an
APA, Harvard, Vancouver, ISO, and other styles
8

El-murtadi, Suleiman Kais. "Interactions Study of Self Optimizing Schemes in LTE Femtocell Networks." Thesis, 2012. http://hdl.handle.net/1974/7683.

Full text
Abstract:
One of the enabling technologies for Long Term Evolution (LTE) deployments is the femtocell technology. By having femtocells deployed indoors and closer to the user, high data rate services can be provided efficiently. These femtocells are expected to be depolyed in large numbers which raises many technical challenges including the handover management. In fact, managing handovers in femtocell environments, with the conventional manual adjustment techniques, is almost impossible to keep pace with in such a rapidly growing femtocell environment. Therefore, doing this automatically by implementin
APA, Harvard, Vancouver, ISO, and other styles
9

Nikjah, Reza. "Performance evaluation and protocol design of fixed-rate and rateless coded relaying networks." Phd thesis, 2010. http://hdl.handle.net/10048/1674.

Full text
Abstract:
The importance of cooperative relaying communication in substituting for, or complementing, multiantenna systems is described, and a brief literature review is presented. Amplify-and-forward (AF) and decode-and-forward (DF) relaying are investigated and compared for a dual-hop relay channel. The optimal strategy, source and relay optimal power allocation, and maximum cooperative gain are determined for the relay channel. It is shown that while DF relaying is preferable to AF relaying for strong source-relay links, AF relaying leads to more gain for strong source-destination or relay-destinatio
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Combinatorics and optimization of evaluation schemes"

1

Quispe, Gloria Lola, Maria Fernanda Rodríguez, and José Daniel Ontiveros. "Comparative Analysis of ACO Algorithms for the Solution of the Travelling Salesman Problem." In Handbook of Research on Software Quality Innovation in Interactive Systems. IGI Global, 2021. http://dx.doi.org/10.4018/978-1-7998-7010-4.ch014.

Full text
Abstract:
Metaheuristics are non-deterministic algorithms. Metaheuristic strategies are related to design. This chapter presents an introduction on metaheuristics, from the point of view of its theoretical study and the foundations for its use. Likewise, a description and comparative study of the ant colony-based algorithms is carried out. These are ant system (AS), ant colony system (ACS), and max-min ant system (MMAS). These results serve to deliver solutions to complex problems and generally with a high degree of combinatorics for those there is no way to find the best reasonable time. An experimentation and analysis of the results of the ACO algorithms (optimization by ants colonies) is also carried out. For the evaluation of the algorithms, comparisons are made for instances of the TSPLIB test instance library. Therefore, it is deepened in the resolution of the travelling salesman problem (TSP), and a comparative analysis of the different algorithms is carried out in order to see which one adjusts better.
APA, Harvard, Vancouver, ISO, and other styles
2

"Costs and Benefits of Logistics Pooling for Urban Freight Distribution." In Logistics and Transport Modeling in Urban Goods Movement. IGI Global, 2019. http://dx.doi.org/10.4018/978-1-5225-8292-2.ch008.

Full text
Abstract:
Collaborative transportation and logistics pooling are relatively new concepts in research, but are very popular in practice. In the last years, collaborative transportation seems a good city logistics alternative to classical urban consolidation centers, but it is still in a development stage. This chapter proposes a framework for urban logistics pooling ex-ante evaluation. This framework is developed with two purposes. The first is to generate comparable contrasted or progressive scenarios representing realistic situations; the second to simulate and assess them to make a “before-after” comparative analysis. In this framework, a demand generation model is combined with a route optimization algorithm to simulate the resulting routes of the proposed individual or collaborative distribution schemes assumed by each scenario. Then, several indicators are obtained. To illustrate that framework, several scenarios for the urban area of Lyon (France) are simulated and discussed to illustrate the proposed framework possible applications.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Combinatorics and optimization of evaluation schemes"

1

Ilham, Amil A., and Kazuaki Murakami. "Evaluation and optimization of Java object ordering schemes." In 2011 International Conference on Electrical Engineering and Informatics (ICEEI). IEEE, 2011. http://dx.doi.org/10.1109/iceei.2011.6021558.

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

Shahriar, A. Z. M., and M. Atiquzzaman. "Evaluation of Prefix Delegation-Based Route Optimization Schemes for NEMO." In ICC 2009 - 2009 IEEE International Conference on Communications. IEEE, 2009. http://dx.doi.org/10.1109/icc.2009.5199009.

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

Altin, Lokman, and Haluk Rahmi Topcuoglu. "Performance evaluation of sensor-based detection schemes on dynamic optimization problems." In 2014 IEEE Symposium on Computational Intelligence in Dynamic and Uncertain Environments (CIDUE). IEEE, 2014. http://dx.doi.org/10.1109/cidue.2014.7007863.

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

de Aragão, O. C. Aquino, I. Pawelec, and P. Sava. "Evaluation of Two Numerical Optimization Schemes for Elastic Full Waveform Inversion." In EAGE 2020 Annual Conference & Exhibition Online. European Association of Geoscientists & Engineers, 2020. http://dx.doi.org/10.3997/2214-4609.202011989.

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

Youssef, Ayman M. A., Ashraf O. Nassef, and Sayed M. Metwalli. "Reverse Engineering of Geometric Surfaces Using Tabu Search Optimization Technique." In ASME 2007 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2007. http://dx.doi.org/10.1115/detc2007-34970.

Full text
Abstract:
Creating unavailable geometric models from existing parts plays an important role in the process of reverse engineering, for which the accuracy and fitting time of the created models are important factors. This paper proposes the use of Tabu Search (TS) technique in the optimal fitting of NURBS (Non Uniform Rational B-Spline) surfaces to laser-scanned point clouds of free-form surfaces for existing parts. The fitting process involves the initial estimation of the NURBS surface control points using least-squares approximation, followed by optimization of NURBS weights to minimize fitting error.
APA, Harvard, Vancouver, ISO, and other styles
6

Powell, Courtney, Phyo Thandar Thant, and Masaharu Munetomo. "Evaluation of Three Steady-State NSGA-III Offspring Selection Schemes for Many-Objective Optimization." In 2016 Joint 8th International Conference on Soft Computing and Intelligent Systems (SCIS) and 17th International Symposium on Advanced Intelligent Systems (ISIS). IEEE, 2016. http://dx.doi.org/10.1109/scis-isis.2016.0045.

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

Kumar, K. V. Kiran, and Gowri Srinivasa. "Evaluation of spatial and frequency domain corneal endothelium cell segmentation schemes for corneal diagnosis." In 2017 IEEE International Conference on Intelligent Techniques in Control, Optimization and Signal Processing (INCOS). IEEE, 2017. http://dx.doi.org/10.1109/itcosp.2017.8303074.

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

Bing, Wei, Zhiwei Wang, Li Li, and Jiang Lu. "Optimization of BCHP Schemes Based on GRA and AHP." In ASME 2007 Energy Sustainability Conference. ASMEDC, 2007. http://dx.doi.org/10.1115/es2007-36231.

Full text
Abstract:
BCHP (Building Cooling, Heating and Power) system is an integrated energy system based on the energy cascade utilization and is used to supply heating, cooling and power synchronously. Normally the scale of BCHP system is smaller than that of the CCHP (Combined Cooling Heating and Power) system of thermal power plant. BCHP system is one of the most important directions of the second generation energy system and distributed energy system and has advantages of energy conservation, environment protection and safety performance, etc. In this paper with the example of an actual building, by using t
APA, Harvard, Vancouver, ISO, and other styles
9

Jianping Wang, Yingchang Duan, Feng Li, and Jian Ma. "Optimization selection evaluation for crossing site establishment schemes of fuzzy matter-element of approaching an ideal solution." In International Conference on Automatic Control and Artificial Intelligence (ACAI 2012). Institution of Engineering and Technology, 2012. http://dx.doi.org/10.1049/cp.2012.1266.

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

Wang, Zhaowen, Peng Deng, Wei Li, and Ronghua Huang. "Study on Structure Optimization and Evaluation Index of Cooling Capacity in a Bi-Layer Coolant Jacket of Cylinder Head." In ASME 2010 International Mechanical Engineering Congress and Exposition. ASMEDC, 2010. http://dx.doi.org/10.1115/imece2010-40168.

Full text
Abstract:
To solve problems such as thermal overload in the cylinder head of a 6-cylinder heavy-duty diesel engine and the thermal cracks in the valve-bridge of the engine. Structure of the coolant jacket was optimized from monolayer to bi-layer, and structures of upper nozzles were also optimized using the orthogonal experimental design method in this paper. At present, the cooling capacity of the coolant jacket in cylinder head is mainly judged by the coolant velocity. In this paper, the coolant heat transfer coefficient (HTC) was adopted as the criterion to evaluate the heat transfer process in cylin
APA, Harvard, Vancouver, ISO, and other styles
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!