Relevant bibliographies by topics / Bin Covering

Contents

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

Academic literature on the topic 'Bin Covering'

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 'Bin Covering.'

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 "Bin Covering"

1

Cao, Zhigang, and Xiaoguang Yang. "Selfish bin covering." Theoretical Computer Science 412, no. 50 (2011): 7049–58. http://dx.doi.org/10.1016/j.tcs.2011.09.017.

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

Epstein, Leah, Csanád Imreh, and Asaf Levin. "Class Constrained Bin Covering." Theory of Computing Systems 46, no. 2 (2008): 246–60. http://dx.doi.org/10.1007/s00224-008-9129-7.

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

CHEN, Feng. "EXACT ALGORITHM FOR BIN COVERING." Journal of Zhejiang University SCIENCE 2, no. 3 (2001): 241. http://dx.doi.org/10.1631/jzus.2001.0241.

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

Epstein, Leah, Csanád Imreh, and Asaf Levin. "Bin covering with cardinality constraints." Discrete Applied Mathematics 161, no. 13-14 (2013): 1975–87. http://dx.doi.org/10.1016/j.dam.2013.03.020.

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

Fukunaga, A. S., and R. E. Korf. "Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems." Journal of Artificial Intelligence Research 28 (March 30, 2007): 393–429. http://dx.doi.org/10.1613/jair.2106.

Full text
Abstract:
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems can be used to model task and resource allocation problems in multi-agent systems and distributed systms, and can also be found as subproblems of scheduling problems. We propose bin completion, a branch-and-bound strategy for one-dimensional, multicontainer packing problems. Bin completion combines a bin-oriented search space with a powerful dominance criterion that enables us to prune much of the space. The performan
APA, Harvard, Vancouver, ISO, and other styles
6

Christ, Marie G., Lene M. Favrholdt, and Kim S. Larsen. "Online bin covering: Expectations vs. guarantees." Theoretical Computer Science 556 (October 2014): 71–84. http://dx.doi.org/10.1016/j.tcs.2014.06.029.

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

Lin, Mingen, Yang Yang, and Jinhui Xu. "On Lazy Bin Covering and Packing problems." Theoretical Computer Science 411, no. 1 (2010): 277–84. http://dx.doi.org/10.1016/j.tcs.2009.10.006.

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

Han, Sunan, Dawei Hong, and Joseph Y.-T. Leung. "Probabilistic analysis of a bin covering algorithm." Operations Research Letters 18, no. 4 (1996): 193–99. http://dx.doi.org/10.1016/0167-6377(95)00053-4.

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

Finlay, Luke, and Prabhu Manyem. "Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing." RAIRO - Operations Research 39, no. 3 (2005): 163–83. http://dx.doi.org/10.1051/ro:2006001.

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

Lin, Mingen, Yang Yang, and Jinhui Xu. "Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems." Algorithmica 57, no. 2 (2008): 232–51. http://dx.doi.org/10.1007/s00453-008-9202-2.

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

Dissertations / Theses on the topic "Bin Covering"

1

Nielsen, Torben Noerup. "Combinatorial Bin Packing Problems." Diss., The University of Arizona, 1985. http://hdl.handle.net/10150/187536.

Full text
Abstract:
In the past few years, there has been a strong and growing interest in evaluating the expected behavior of what we call combinatorial bin packing problems. A combinatorial bin packing problem consists of a number of items of various sizes and value ratios (value per unit of size) along with a collection of bins of fixed capacity into which the items are to be packed. The packing must be done in such a way that the sum of the sizes of the items into a given bin does not exceed the capacity of that bin. Moreover, an item must either be packed into a bin in its entirety or not at all: this "all o
APA, Harvard, Vancouver, ISO, and other styles
2

Hellwig, Matthias. "On semi-online machine scheduling and generalized bin covering." Doctoral thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, 2013. http://dx.doi.org/10.18452/16782.

Full text
Abstract:
In dieser Arbeit untersuchen wir Algorithmen für Scheduling-Probleme. Wir betrachten semi-online Makespan-Scheduling und generalisiertes Bin Covering. Im online Makespan- Scheduling-Problem sind m Maschinen und n Jobs gegeben, wobei letztere jeweils eine individuelle Bearbeitungszeit haben. Es wird zu jedem Zeitpunkt ein Job offengelegt und muss sofort und unwiderruflich einer Maschine zugewiesen werden, ohne Wissen über zukünftige Jobs. Die Last einer Maschine wird als die Summe der Bearbeitungszeiten der ihr zugewiesenen Jobs definiert. Das Ziel ist es, eine Zuweisung von Jobs zu Maschinen zu
APA, Harvard, Vancouver, ISO, and other styles
3

Asgeirsson, Agni. "On-line algorithms for bin-covering problems with known item distributions." Diss., Georgia Institute of Technology, 2014. http://hdl.handle.net/1853/53413.

Full text
Abstract:
This thesis focuses on algorithms solving the on-line Bin-Covering problem, when the items are generated from a known, stationary distribution. We introduce the Prospect Algorithm. The main idea behind the Prospect Algorithm is to use information on the item distribution to estimate how easy it will be to fill a bin with small overfill as a function of the empty space left in it. This estimate is then used to determine where to place the items, so that all active bins either stay easily fillable, or are finished with small overfill. We test the performance of the algorithm by simulation, and
APA, Harvard, Vancouver, ISO, and other styles
4

Martirosyan, Sosina. "Perfect hash families, identifiable parent property codes and covering arrays." [S.l. : s.n.], 2003. http://deposit.ddb.de/cgi-bin/dokserv?idn=970934955.

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

Annen, Oliver. "Das Partial set covering problem und Erweiterungen Modellierung und Lösungsverfahren /." [S.l. : s.n.], 2003. http://deposit.ddb.de/cgi-bin/dokserv?idn=969854226.

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

Hellwig, Matthias [Verfasser], Susanne [Akademischer Betreuer] Albers, Csanád [Akademischer Betreuer] Imreh, and Alexander [Akademischer Betreuer] Souza. "On semi-online machine scheduling and generalized bin covering / Matthias Hellwig. Gutachter: Susanne Albers ; Csanád Imreh ; Alexander Souza." Berlin : Humboldt Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, 2013. http://d-nb.info/1037774485/34.

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

Zyl, Jacobus van. "Fuzzy set covering as a new paradigm for the induction of fuzzy classification rules." [S.l.] : [s.n.], 2007. http://deposit.ddb.de/cgi-bin/dokserv?idn=984768548.

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

Larchevêque, Hubert. "Agrégation de ressources avec contrainte de distance : applications aux plateformes de grande échelle." Phd thesis, Université Sciences et Technologies - Bordeaux I, 2010. http://tel.archives-ouvertes.fr/tel-00580962.

Full text
Abstract:
Durant cette thèse, nous avons introduit les problèmes de Bin Covering avec Contrainte de Distance (BCCD) et de Bin Packing avec Contrainte de Distance (BPCD), qui trouvent leur application dans les réseaux de grande échelle, tel Internet. L'étude de ces problèmes que nous effectuons dans des espaces métriques quelconques montre qu'il est impossible de travailler dans un tel cadre sans avoir recours à de l'augmentation de ressources, un procédé qui permet d'élaborer des algorithmes construisant des solutions moins contraintes que la solution optimale à laquelle elles sont comparées. En plus de
APA, Harvard, Vancouver, ISO, and other styles
9

Mecke, Steffen. "Standortplanung von Bahnhöfen." [S.l. : s.n.], 2003. http://www.bsz-bw.de/cgi-bin/xvms.cgi?SWB10806380.

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

Sheppard, Nicholas Paul. "Self-Reduction for Combinatorial Optimisation." University of Sydney. Computer Science, 2001. http://hdl.handle.net/2123/797.

Full text
Abstract:
This thesis presents and develops a theory of self-reduction. This process is used to map instances of combinatorial optimisation problems onto smaller, more easily solvable instances in such a way that a solution of the former can be readily re-constructed, without loss of information or quality, from a solution of the latter. Self-reduction rules are surveyed for the Graph Colouring Problem, the Maximum Clique Problem, the Steiner Problem in Graphs, the Bin Packing Problem and the Set Covering Problem. This thesis introduces the problem of determining the maximum sequence of self-r
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Bin Covering"

1

Di ban di xuan ze yü shi yung. Lin yü wen hua shi yeh yu xian gong si, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Smailes, Brian G. The national 3 peaks 26 miles walking: Ben Nevis -Scotland, Scafell Pike - England,Snowdon - Wales, one book covering 3 mountains : an essential guide to help you complete the national 3 peaks walk. Challenge, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Covering Bin Laden: Global Media and the World's Most Wanted Man. University of Illinois Press, 2015.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Al-Sumait, Fahed, and Susan Jeffords. Covering Bin Laden: Global Media and the World's Most Wanted Man. University of Illinois Press, 2015.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

News Frames and National Security: Covering Big Brother. Cambridge University Press, 2014.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Bannerman, Gordon. Political Science at the LSE: A History of the Department of Government, from the Webbs to COVID. Edited by Cheryl Schonhardt-Bailey. Ubiquity Press, 2021. http://dx.doi.org/10.5334/bcn.

Full text
Abstract:
This monograph traces the emergence and evolution of the LSE Government Department from 1895 to 2020, focusing on the personalities that guided the development of the Department, the social and political contexts the Department existed within, its research agenda and course structure, and the location of the Department in British politics. It also charts the evolution of the discipline of political science in Britain itself. The volume is divided chronologically into four chapters, each covering roughly similar time periods in the Departments’ history and focused on the events that shaped it:
APA, Harvard, Vancouver, ISO, and other styles
7

ṿeha-tashtit, Israel Miśrad ha-energyah, Atar ha-Solari ʻa. sh. Ben-Guryon bi-Śedeh-Boḳer., and Makhon le-ḥeḳer ha-midbar ʻal shem Blaʼushṭain (Śedeh Boḳer, Israel), eds. The Ben-Gurion National Solar Energy Center: Report covering January-December 1992. State of Israel, Ministry of Energy & Infrastructure, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Musson's cyclopaedia of music and musicians: Covering the entire period of musical history from the earliest times to the season of 1909-10. Musson, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

1916-, Blake Robert, and Nicholls C. S, eds. The Dictionary of national biography, 1971-1980: With an index covering the years 1901-1980 in one alphabetical series. Oxford University Press, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Marlow, Eugene. Jazz in China. University Press of Mississippi, 2018. http://dx.doi.org/10.14325/mississippi/9781496817990.001.0001.

Full text
Abstract:
This book traces China's introduction to jazz in the early 1920s, its interruption by Chinese leadership under Mao in 1949, and its rejuvenation in the early 1980s with the start of China's opening to the world under Premier Deng Xiaoping. Covering a span of almost one hundred years, the book focuses on a variety of subjects—the musicians who initiated jazz performances in China, the means by which jazz was incorporated into Chinese culture, and the musicians and venues that now present jazz performances. Featuring unique, face-to-face interviews with leading indigenous jazz musicians in Beiji
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Bin Covering"

1

Boyar, Joan, Lene M. Favrholdt, Shahin Kamali, and Kim S. Larsen. "Online Bin Covering with Advice." In Lecture Notes in Computer Science. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-24766-9_17.

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

Christ, Marie G., Lene M. Favrholdt, and Kim S. Larsen. "Online Bin Covering: Expectations vs. Guarantees." In Combinatorial Optimization and Applications. Springer International Publishing, 2013. http://dx.doi.org/10.1007/978-3-319-03780-6_20.

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

Li, Weian, Qizhi Fang, and Wenjing Liu. "An Incentive Mechanism for Selfish Bin Covering." In Combinatorial Optimization and Applications. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-48749-6_46.

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

Lin, Mingen, Yang Yang, and Jinhui Xu. "On Lazy Bin Covering and Packing Problems." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11809678_36.

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

He, Yong, and György Dósa. "Bin Packing and Covering Problems with Rejection." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11533719_89.

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

Fischer, Carsten, and Heiko Röglin. "Probabilistic Analysis of Online (Class-Constrained) Bin Packing and Bin Covering." In LATIN 2018: Theoretical Informatics. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-77404-6_34.

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

Lin, Mingen, Yang Yang, and Jinhui Xu. "Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems." In Algorithms and Computation. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11940128_57.

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

Hellwig, Matthias, and Alexander Souza. "Approximation Algorithms for Generalized and Variable-Sized Bin Covering." In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-32512-0_17.

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

Jansen, Klaus, and Roberto Solis-Oba. "An Asymptotic Fully Polynomial Time Approximation Scheme for Bin Covering." In Algorithms and Computation. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-36136-7_16.

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

Fischer, Carsten, and Heiko Röglin. "Probabilistic Analysis of the Dual Next-Fit Algorithm for Bin Covering." In LATIN 2016: Theoretical Informatics. Springer Berlin Heidelberg, 2016. http://dx.doi.org/10.1007/978-3-662-49529-2_35.

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

Conference papers on the topic "Bin Covering"

1

Fang, Qizhi, and Jianyuan Sun. "Computational complexity on the cores of bin covering game." In 2014 International Conference on Progress in Informatics and Computing (PIC). IEEE, 2014. http://dx.doi.org/10.1109/pic.2014.6972405.

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

Benko, Attila, Gyorgy Dosa, and Zsolt Tuza. "Bin Packing/Covering with Delivery, solved with the evolution of algorithms." In 2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA). IEEE, 2010. http://dx.doi.org/10.1109/bicta.2010.5645312.

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

Roselli, Sabino, Fredrik Hagebring, Sarmad Riazi, Martin Fabian, and Knut Akesson. "On the Use of Equivalence Classes for Optimal and Sub-Optimal Bin Covering." In 2019 IEEE 15th International Conference on Automation Science and Engineering (CASE). IEEE, 2019. http://dx.doi.org/10.1109/coase.2019.8843323.

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

Hundscheid, Bert H. H., Kay Peeters, Jelle Adan, Tugce Martagan, and Ivo J. B. F. Adan. "A Hybrid Genetic Algorithm for the K-Bounded Semi-Online Bin Covering Problem in Batching Machines." In 2019 Winter Simulation Conference (WSC). IEEE, 2019. http://dx.doi.org/10.1109/wsc40007.2019.9004825.

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

Liu, Huafeng, and Qiong Li. "Work in progress: Threshold analysis for full area coverage in three dimensions based on bin-covering technique." In 2014 9th International Conference on Communications and Networking in China (CHINACOM). IEEE, 2014. http://dx.doi.org/10.1109/chinacom.2014.7054257.

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

Kolias, Vasilis, Ioannis Anagnostopoulos, and Eleftherios Kayafas. "A Covering Classification Rule Induction Approach for Big Datasets." In 2014 IEEE/ACM International Symposium on Big Data Computing (BDC). IEEE, 2014. http://dx.doi.org/10.1109/bdc.2014.17.

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

Wei, Junchao, Zaibin Chang, and Lingling Mao. "Matrix-based optimistic multigranulation fuzzy covering rough sets." In 2021 IEEE 2nd International Conference on Big Data, Artificial Intelligence and Internet of Things Engineering (ICBAIE). IEEE, 2021. http://dx.doi.org/10.1109/icbaie52039.2021.9390045.

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

Waycaster, Garrett, Sai-Kit Wu, Tad Driver, and Xiangrong Shen. "Design and Control of a Compact and Flexible Pneumatic Artificial Muscle Actuation System: Part One—Design Process." In ASME 2011 Dynamic Systems and Control Conference and Bath/ASME Symposium on Fluid Power and Motion Control. ASMEDC, 2011. http://dx.doi.org/10.1115/dscc2011-6067.

Full text
Abstract:
This paper describes the design and control of a compact and flexible pneumatic artificial muscle (PAM) actuation system for bio-robotic systems. The entire paper is divided into two parts, with the first part covering the mechanism design and the second part covering the corresponding controller design. This novel system presented in this part incorporates two new features, including a variable-radius pulley based PAM actuation mechanism, and a spring-return mechanism to replace the PAM in the “weak” direction. With the pulley radius as a function of the joint angle, this new feature enables
APA, Harvard, Vancouver, ISO, and other styles
9

Wang, Dongqiang, and Zuoming Yu. "Accuracy Comparison of Approximation Operators between Granule Coverings and Their Refinements." In 2020 5th IEEE International Conference on Big Data Analytics (ICBDA). IEEE, 2020. http://dx.doi.org/10.1109/icbda49040.2020.9101214.

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

Samec, Vanja, Johann Stampler, Jan Osterz, Jaroslav Navrátil, and Moonjoo Byun. "Towards a Holistic Bridge BIM Solution." In IABSE Conference, Seoul 2020: Risk Intelligence of Infrastructures. International Association for Bridge and Structural Engineering (IABSE), 2020. http://dx.doi.org/10.2749/seoul.2020.174.

Full text
Abstract:
<p>A new BIM solution tailored for bridge engineering has recently been developed, with the ambition of successively covering all tasks related to bridge design, construction, and management throughout lifetime.</p><p>Currently, the solution already contains a variety of bridge design functionality from parametric modeling to structural analysis and checking procedures. Based on an intelligent 4D model of the structure including the construction timeline in addition to the parametrically described geometric model, an appropriate analysis model is automatically created.</p&
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Bin Covering"

1

Scholz, Florian. Sedimentary fluxes of trace metals, radioisotopes and greenhouse gases in the southwestern Baltic Sea Cruise No. AL543, 23.08.2020 – 28.08.2020, Kiel – Kiel - SEDITRACE. GEOMAR Helmholtz Centre for Ocean Research Kiel, 2020. http://dx.doi.org/10.3289/cr_al543.

Full text
Abstract:
R/V Alkor Cruise AL543 was planned as a six-day cruise with a program of water column and sediment sampling in Kiel Bight and the western Baltic Sea. Due to restrictions related to the Covid-19 pandemic, the original plan had to be changed and the cruise was realized as six oneday cruises with sampling in Kiel Bight exclusively. The first day was dedicated to water column and sediment sampling for radionuclide analyses at Boknis Eck and Mittelgrund in Eckernförde Bay. On the remaining five days, water column, bottom water, sediment and pore water samples were collected at eleven stations cover
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!

To the bibliography