Gotowe bibliografie tematyczne / Over-Constrained

Gotowa bibliografia na temat „Over-Constrained”

Autor: Grafiati
Data publikacji: 4 czerwca 2021
Data aktualizacji: 20 lutego 2023

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Spis treści

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Over-Constrained”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Artykuły w czasopismach na temat "Over-Constrained"

1

Holland, Finbarr. "Over-constrained Triangles". Irish Mathematical Society Bulletin 0072 (2013): 79–83. http://dx.doi.org/10.33232/bims.0072.79.83.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Boylu, Fidan, Haldun Aytug i Gary J. Koehler. "Induction over constrained strategic agents". European Journal of Operational Research 203, nr 3 (czerwiec 2010): 698–705. http://dx.doi.org/10.1016/j.ejor.2009.09.028.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Abaid, Nicole, i Maurizio Porfiri. "Consensus Over Numerosity-Constrained Random Networks". IEEE Transactions on Automatic Control 56, nr 3 (marzec 2011): 649–54. http://dx.doi.org/10.1109/tac.2010.2092270.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Zhan Shu i Richard H. Middleton. "Stabilization Over Power-Constrained Parallel Gaussian Channels". IEEE Transactions on Automatic Control 56, nr 7 (lipiec 2011): 1718–24. http://dx.doi.org/10.1109/tac.2011.2135270.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Shew, P. W., i P. Y. Hsiao. "Planar constrained terminals over-the-cell router". IEE Proceedings - Computers and Digital Techniques 144, nr 2 (1997): 121. http://dx.doi.org/10.1049/ip-cdt:19971157.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Lim, A., B. Rodrigues, R. Thangarajoo i F. Xiao. "A Hybrid Framework for Over-Constrained Generalized". Artificial Intelligence Review 22, nr 3 (listopad 2004): 211–43. http://dx.doi.org/10.1007/s10462-004-1286-8.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Ding, H., A. Lim, B. Rodrigues i Y. Zhu. "The over-constrained airport gate assignment problem". Computers & Operations Research 32, nr 7 (lipiec 2005): 1867–80. http://dx.doi.org/10.1016/j.cor.2003.12.003.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Chen, Yueting, Nick Koudas, Xiaohui Yu i Ziqiang Yu. "Spatial and temporal constrained ranked retrieval over videos". Proceedings of the VLDB Endowment 15, nr 11 (lipiec 2022): 3226–39. http://dx.doi.org/10.14778/3551793.3551865.

Pełny tekst źródła
Streszczenie:
Recent advances in Computer Vision (CV) algorithms have improved accuracy and efficiency, making video annotations possible with high accuracy. In this paper, we utilize the annotated data provided by such algorithms and construct graph representations to capture both object labels and spatial-temporal relationships of objects in videos. We define the problem of Spatial and Temporal Constrained Ranked Retrieval (STAR Retrieval) over videos. Based on the graph representation, we propose a two-phase approach, consisting of the ingestion phase, where we construct and materialize the Graph Index (GI), and the query phase, where we compute the top ranked windows (video clips) according to the window matching score efficiently. We propose two algorithms to perform Spatial Matching (SMA) and Temporal Matching (TM) separately with an early-stopping mechanism. Our experiments demonstrate the effectiveness of the proposed methods, achieving orders of magnitude speedups on queries with high selectivity.
Style APA, Harvard, Vancouver, ISO itp.
9

Pezzutto, M., E. Garone i L. Schenato. "Reference Governor for Constrained Control Over Lossy Channels". IEEE Control Systems Letters 4, nr 2 (kwiecień 2020): 271–76. http://dx.doi.org/10.1109/lcsys.2019.2924411.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Sideris, Athanasios, i Héctor Rotstein. "Constrained $H_infty$ Optimal Control over an Infinite Horizon". SIAM Journal on Control and Optimization 35, nr 4 (lipiec 1997): 1244–62. http://dx.doi.org/10.1137/s0363012995256898.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Rozprawy doktorskie na temat "Over-Constrained"

1

Beaumont, Matthew, i n/a. "Handling Over-Constrained Temporal Constraint Networks". Griffith University. School of Information Technology, 2004. http://www4.gu.edu.au:8080/adt-root/public/adt-QGU20041213.084512.

Pełny tekst źródła
Streszczenie:
Temporal reasoning has been an active research area for over twenty years, with most work focussing on either enhancing the efficiency of current temporal reasoning algorithms or enriching the existing algebras. However, there has been little research into handling over-constrained temporal problems except to recognise that a problem is over-constrained and then to terminate. As many real-world temporal reasoning problems are inherently over-constrained, particularly in the scheduling domain, there is a significant need for approaches that can handle over-constrained situations. In this thesis, we propose two backtracking algorithms to gain partial solutions to over-constrained temporal problems. We also propose a new representation, the end-point ordering model, to allow the use of local search algorithms for temporal reasoning. Using this model we propose a constraint weighting local search algorithm as well as tabu and random-restart algorithms to gain partial solutions to over-constrained temporal problems. Specifically, the contributions of this thesis are: The introduction and empirical evaluation of two backtracking algorithms to solve over-constrained temporal problems. We provide two backtracking algorithms to close the gap in current temporal research to solve over-constrained problems; The representation of temporal constraint networks using the end-point ordering model. As current representation models are not suited for local search algorithms, we develop a new model such that local search can be applied efficiently to temporal reasoning; The development of a constraint weighting local search algorithm for under-constrained problems. As constraint weighting has proven to be efficient for solving many CSP problems, we implement a constraint weighting algorithm to solve under-constrained temporal problems; An empirical evaluation of constraint weighting local search against traditional backtracking algorithms. We compare the results of a constraint weighting algorithm with traditional backtracking approaches and find that in many cases constraint weighting has superior performance; The development of a constraint weighting local search, tabu search and random-restart local search algorithm for over-constrained temporal problems. We extend our constraint weighting algorithm to solve under-constrained temporal problems as well as implement two other popular local search algorithms: tabu search and random-restart; An empirical evaluation of all three local search algorithms against the two backtracking algorithms. We compare the results of all three local search algorithms with our twobacktracking algorithms for solving over-constrained temporal reasoning problems and find that local search proves to be considerably superior.
Style APA, Harvard, Vancouver, ISO itp.
2

Mahanta, Girish. "Video transmission over constrained-bandwidth channels". Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp03/MQ39991.pdf.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Beaumont, Matthew. "Handling Over-Constrained Temporal Constraint Networks". Thesis, Griffith University, 2004. http://hdl.handle.net/10072/366603.

Pełny tekst źródła
Streszczenie:
Temporal reasoning has been an active research area for over twenty years, with most work focussing on either enhancing the efficiency of current temporal reasoning algorithms or enriching the existing algebras. However, there has been little research into handling over-constrained temporal problems except to recognise that a problem is over-constrained and then to terminate. As many real-world temporal reasoning problems are inherently over-constrained, particularly in the scheduling domain, there is a significant need for approaches that can handle over-constrained situations. In this thesis, we propose two backtracking algorithms to gain partial solutions to over-constrained temporal problems. We also propose a new representation, the end-point ordering model, to allow the use of local search algorithms for temporal reasoning. Using this model we propose a constraint weighting local search algorithm as well as tabu and random-restart algorithms to gain partial solutions to over-constrained temporal problems. Specifically, the contributions of this thesis are: The introduction and empirical evaluation of two backtracking algorithms to solve over-constrained temporal problems. We provide two backtracking algorithms to close the gap in current temporal research to solve over-constrained problems; The representation of temporal constraint networks using the end-point ordering model. As current representation models are not suited for local search algorithms, we develop a new model such that local search can be applied efficiently to temporal reasoning; The development of a constraint weighting local search algorithm for under-constrained problems. As constraint weighting has proven to be efficient for solving many CSP problems, we implement a constraint weighting algorithm to solve under-constrained temporal problems; An empirical evaluation of constraint weighting local search against traditional backtracking algorithms. We compare the results of a constraint weighting algorithm with traditional backtracking approaches and find that in many cases constraint weighting has superior performance; The development of a constraint weighting local search, tabu search and random-restart local search algorithm for over-constrained temporal problems. We extend our constraint weighting algorithm to solve under-constrained temporal problems as well as implement two other popular local search algorithms: tabu search and random-restart; An empirical evaluation of all three local search algorithms against the two backtracking algorithms. We compare the results of all three local search algorithms with our twobacktracking algorithms for solving over-constrained temporal reasoning problems and find that local search proves to be considerably superior.
Thesis (PhD Doctorate)
Doctor of Philosophy (PhD)
Institute for Integrated and Intelligent Systems
Full Text
Style APA, Harvard, Vancouver, ISO itp.
4

Jampel, Michael Benjamin. "Over-constrained systems in CLP and CSP". Thesis, City University London, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.319633.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Yu, Peng Ph D. Massachusetts Institute of Technology Department of Aeronautics and Astronautics. "Continuous relaxation to over-constrained temporal plans". Thesis, Massachusetts Institute of Technology, 2013. http://hdl.handle.net/1721.1/79336.

Pełny tekst źródła
Streszczenie:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2013.
This electronic version was submitted and approved by the author's academic department as part of an electronic thesis pilot project. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from department-submitted PDF version of thesis.
Includes bibliographical references (p. 165-168).
When humans fail to understand the capabilities of an autonomous system or its environmental limitations, they can jeopardize their objectives and the system by asking for unrealistic goals. The objective of this thesis is to enable consensus between human and autonomous system, by giving autonomous systems the ability to communicate to the user the reasons for goal failure and the relaxations to goals that archive feasibility. We represent our problem in the context of temporal plans, a set of timed activities that can represent the goals and constraints proposed by users. Over-constrained temporal plans are commonly encountered while operating autonomous and decision support systems, when user objectives are in conflict with the environment. Over constrained plans are addressed by relaxing goals and or constraints, such as delaying the arrival time of a trip, with some candidate relaxations being preferable to others. In this thesis we present Uhura, a temporal plan diagnosis and relaxation algorithm that is designed to take over-constrained input plans with temporal flexibility and contingencies, and generate temporal relaxations that make the input plan executable. We introduce two innovative approaches within Uhura: collaborative plan diagnosis and continuous relaxation. Uhura focuses on novel ways of satisfying three goals to make the plan relaxation process more convenient for the users: small perturbation, quick response and simple interaction. First, to achieve small perturbation, Uhura resolves over-constrained temporal plans through partial relaxation of goals, more specifically, through the relaxation of schedules. Prior work on temporal relaxations takes an all-or-nothing approach in which timing constraints on goals, such as arrival times to destinations, are completely relaxed in the relaxations. The Continuous Temporal Relaxation method used by Uhura adjusts the temporal bounds of temporal constraints to minimizes the perturbation caused by the relaxations to the goals in the original plan. Second, to achieve quick responses, Uhura introduces Best-first Conflict-directed Relaxation, a new method that efficiently enumerates alternative options in best-first order. The search space of alternative options to temporal planning problems is very large and finding the best one is a NP-hard problem. Uhura empirically demonstrates fast enumeration by unifying methods from minimal relaxation and conflict-directed enumeration methods, first developed for model based diagnosis. Uhura achieves two orders of magnitude improvement in run-time performance relative to state-of-the-art approaches, making it applicable to a larger group of real-world scenarios with complex temporal plans. Finally, to achieve simple interactions, Uhura presents to the user a small set of preferred relaxations in best-first order based on user preference models. By using minimal relaxations to represent alternative options, Uhura simplifies the options presented to the user and reduces the size of its results and improves their expressiveness. Previous work either generates minimal relaxations or full relaxations based on preference, but not minimal relaxations based on preference. Preferred minimal relaxations simplify the interaction in that the users do not have to consider any irrelevant information, and may reach an agreement with the autonomous system faster. Therefore it makes communication between robots and users more convenient and precise. We have incorporated Uhura within an autonomous executive that collaborates with human operators to resolve over-constrained temporal plans. Its effectiveness has been demonstrated both in simulation and in hardware on a Personal Transportation System concept. The average runtime of Uhura on large problems with 200 activities is two order of magnitude lower compared to current approaches. In addition, Uhura has also been used in a driving assistant system to resolve conflicts in driving plans. We believe that Uhura's collaborative temporal plan diagnosis capability can benefit a wide range of applications, both within industrial applications and in our daily lives.
by Peng Yu.
S.M.
Style APA, Harvard, Vancouver, ISO itp.
6

Bain, Stuart, i n/a. "Evolving Algorithms for Over-Constrained and Satisfaction Problems". Griffith University. School of Information and Communication Technology, 2007. http://www4.gu.edu.au:8080/adt-root/public/adt-QGU20071126.080227.

Pełny tekst źródła
Streszczenie:
The notion that a universally effective problem solver may still exist, and is simply waiting to be found, is slowly being abandoned in the light of a growing body of work reporting on the narrow applicability of individual heuristics. As the formalism of the constraint satisfaction problem remains a popular choice for the representation of problems to be solved algorithmically, there exists an ongoing need for new algorithms to effciently handle the disparate range of problems that have been posed in this representation. Given the costs associated with manually applying human algorithm development and problem solving expertise, methods that can automatically adapt to the particular features of a specific class of problem have begun to attract more attention. Whilst a number of authors have developed adaptive systems, the field, and particularly with respect to their application to constraint satisfaction problems, has seen only limited discussion as to what features are desirable for an adaptive constraint system. This may well have been a limiting factor with previous implementations, which have exhibited only subsets of the five features identified in this work as important to the utility of an adaptive constraint satisfaction system. Whether an adaptive system exhibits these features depends on both the chosen represen-tation and the method of adaptation. In this thesis, a three-part representation for constraint algorithms is introduced, which defines an algorithm in terms of contention, preference and selection functions. An adaptive system based on genetic programming is presented that adapts constraint algorithms described using the mentioned three-part representation. This is believed to be the first use of standard genetic programming for learning constraint algo-rithms. Finally, to further demonstrate the efficacy of this adaptive system, its performance in learning specialised algorithms for hard, real-world problem instances is thoroughly evaluated. These instances include random as well as structured instances from known-hard benchmark distributions, industrial problems (specifically, SAT-translated planning and cryptographic problems) as well as over-constrained problem instances. The outcome of this evaluation is a set of new algorithms - valuable in their own right - specifically tailored to these problem classes. Partial results of this work have appeared in the following publications: [1] Stuart Bain, John Thornton, and Abdul Sattar (2004) Evolving algorithms for constraint satisfaction. In Proc. of the 2004 Congress on Evolutionary Computation, pages 265-272. [2] Stuart Bain, John Thornton, and Abdul Sattar (2004) Methods of automatic algorithm generation. In Proc. of the 9th Pacific Rim Conference on AI, pages 144-153. [3] Stuart Bain, John Thornton, and Abdul Sattar. (2005) A comparison of evolutionary methods for the discovery of local search heuristics. In Australian Conference on Artificial Intelligence: AI'05, pages 1068-1074. [4] Stuart Bain, John Thornton, and Abdul Sattar (2005) Evolving variable-ordering heuristics for constrained optimisation. In Principles and Practice of Constraint Programming: CP'05, pages 732-736.
Style APA, Harvard, Vancouver, ISO itp.
7

Nesh-Nash, Ali. "Voice over IP in a resource constrained environment". Thesis, KTH, Kommunikationssystem, CoS, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-92257.

Pełny tekst źródła
Streszczenie:
Today, the telecommunication world is focused on mobility. This is popular because since the 1990s most people have integrated their mobile phones into their life. A new factor is the rise of the voice over IP(VoIP) technology, with VoIP over Wireless LANs (WLANs) as the clear next growth area for mobile communications. The purpose of this thesis was to understand how to save power based upon changing when some operations are performed in a VoIP client. In order to do this, we decided to port minisip to an HP iPAQ 5500 Personal Digital Assistant (PDA), in order to explore some of the issues of running such a client on a PDA - due to its constraints with regard to storage, processing power, and battery power. Minisip is a SIP open source user agent running on Linux and Windows. This thesis builds upon earlier theses which showed that minisip can offer a secure communications platform with the latest functions which are desired in a mobile personal VoIP system. However, most of these earlier theses utilized desktop, laptop, or server based system, i.e., with few resources constrains. The focus of this thesis was to examine the case of a highly constrained user platform such as an iPAQ.
Dagens telekommunikationssystem fokuserar på mobilitet. Detta har blivit populärt under 90-talet då mobilitet blev naturligt integrerad i människans vardagliga liv i form av exempelvis mobiltelefoner. Voice over IP (VoIP) har blivit en stor del av dagen teknik där trådlösa system Wireless LANs (WLANs) har blivit en större del av mobilkommunikation. Målet med denna rapport är att förstå hur strömförbrukningen kan minimeras genom att utföra vissa operationer med hjälp av en VoIP-klient. För att åstadkomma detta porterade vi minisip, en SIP agent som är baserad på öppen källkod och körs på Linux och Windows, till en HP iPAQ 5500, en så kallad Personal Digital Assistant (PDA). Vi valde PDAn för att kunna utforska de begränsningar den medför i form av lagringsutrymme, processorkapacitet, och batteri. Denna rapport bygger vidare på tidigare rapporter som visar att minisip kan erbjuda en säker kommunikationsplattform med de senaste funktionerna som önskas i mobila VoIPsystem. De flesta av dessa tidigare rapporter baseras på system med få begränsningar rörande resurser såsom stationära- eller bärbara datorer samt serverbaserade system. Denna rapports fokus är att utforska detta fall i en miljö med större begränsningar på resurser som till exempel en iPAQ.
Style APA, Harvard, Vancouver, ISO itp.
8

Cheng, Huang. "A Resource-Constrained Coverage Protocol Over Urban VANETs". Thèse, Université d'Ottawa / University of Ottawa, 2014. http://hdl.handle.net/10393/30913.

Pełny tekst źródła
Streszczenie:
Vehicular ad hoc networks have emerged as a promising area of research in academic fields. However, it presents a challenge to design a realistic coverage protocol for ve- hicular networks, due to the service requirements, assorted mobility patterns, resource constraints and irregularity of the service area. It is also a challenge to meet a high quality of coverage with a tight deployment budget. In order to resolve these problems, this thesis proposes a resource-constrained coverage protocol with statistical analysis, which aims to consider the application demands, mobility patterns of vehicles, resource limitations, and geometrical attributes of road networks. We study two types of resource-constrained coverage: the continuous coverage model and the sparse coverage model. We then reduce each model to a Knapsack Constrained Steiner Tree problem and a Maximum Coverage Problem, respectively. Since the two reduced problems are NP-hard, we resolve each of them with the Lagrangian Decompo- sition approach and greedy algorithm. By taking the dimensions of road segments into account, our coverage protocol provides a buffering operation scheme to suit different types of road topology. By discovering hotspots from the historical trace files, the pro- posed protocol is able to depict the mobility patterns and to discover the most valuable regions of a road system. To solve the problems of resource constraint, we provide two variants of continuous coverage and sparse coverage by taking budget constraint and quality constraint into consideration. The comparison with other mature algorithms verifies that our coverage protocol is reliable, and suitable for urban vehicular networks.
Style APA, Harvard, Vancouver, ISO itp.
9

Bain, Stuart. "Evolving Algorithms for Over-Constrained and Satisfaction Problems". Thesis, Griffith University, 2007. http://hdl.handle.net/10072/365848.

Pełny tekst źródła
Streszczenie:
The notion that a universally effective problem solver may still exist, and is simply waiting to be found, is slowly being abandoned in the light of a growing body of work reporting on the narrow applicability of individual heuristics. As the formalism of the constraint satisfaction problem remains a popular choice for the representation of problems to be solved algorithmically, there exists an ongoing need for new algorithms to effciently handle the disparate range of problems that have been posed in this representation. Given the costs associated with manually applying human algorithm development and problem solving expertise, methods that can automatically adapt to the particular features of a specific class of problem have begun to attract more attention. Whilst a number of authors have developed adaptive systems, the field, and particularly with respect to their application to constraint satisfaction problems, has seen only limited discussion as to what features are desirable for an adaptive constraint system. This may well have been a limiting factor with previous implementations, which have exhibited only subsets of the five features identified in this work as important to the utility of an adaptive constraint satisfaction system. Whether an adaptive system exhibits these features depends on both the chosen represen-tation and the method of adaptation. In this thesis, a three-part representation for constraint algorithms is introduced, which defines an algorithm in terms of contention, preference and selection functions. An adaptive system based on genetic programming is presented that adapts constraint algorithms described using the mentioned three-part representation. This is believed to be the first use of standard genetic programming for learning constraint algo-rithms. Finally, to further demonstrate the efficacy of this adaptive system, its performance in learning specialised algorithms for hard, real-world problem instances is thoroughly evaluated. These instances include random as well as structured instances from known-hard benchmark distributions, industrial problems (specifically, SAT-translated planning and cryptographic problems) as well as over-constrained problem instances. The outcome of this evaluation is a set of new algorithms - valuable in their own right - specifically tailored to these problem classes. Partial results of this work have appeared in the following publications: [1] Stuart Bain, John Thornton, and Abdul Sattar (2004) Evolving algorithms for constraint satisfaction. In Proc. of the 2004 Congress on Evolutionary Computation, pages 265-272. [2] Stuart Bain, John Thornton, and Abdul Sattar (2004) Methods of automatic algorithm generation. In Proc. of the 9th Pacific Rim Conference on AI, pages 144-153. [3] Stuart Bain, John Thornton, and Abdul Sattar. (2005) A comparison of evolutionary methods for the discovery of local search heuristics. In Australian Conference on Artificial Intelligence: AI'05, pages 1068-1074. [4] Stuart Bain, John Thornton, and Abdul Sattar (2005) Evolving variable-ordering heuristics for constrained optimisation. In Principles and Practice of Constraint Programming: CP'05, pages 732-736.
Thesis (PhD Doctorate)
Doctor of Philosophy (PhD)
School of Information and Communication Technology
Faculty of Engineering and Information Technology
Full Text
Style APA, Harvard, Vancouver, ISO itp.
10

Al-Regib, Ghassan. "Delay-constrained 3-D graphics streaming over lossy networks". Diss., Georgia Institute of Technology, 2003. http://hdl.handle.net/1853/15428.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Książki na temat "Over-Constrained"

1

Jampel, Michael, Eugene Freuder i Michael Maher, red. Over-Constrained Systems. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61479-6.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Michael, Jampel, Freuder Eugene C, Maher Michael 1959- i CP '95 (1995 : Cassis, France), red. Over-constrained systems. Berlin: Springer, 1996.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Liu, Qinyuan, Zidong Wang i Xiao He. Stochastic Control and Filtering over Constrained Communication Networks. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-00157-5.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Mahvidi, Hamid. Performance of latency constrained turbo-like codes over correlated fading channels. Ottawa: National Library of Canada, 2000.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Wang, Zidong, Qinyuan Liu i Xiao He. Stochastic Control and Filtering over Constrained Communication Networks. Springer, 2019.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Wang, Zidong, Qinyuan Liu i Xiao He. Stochastic Control and Filtering over Constrained Communication Networks. Springer, 2018.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Cost-Constrained Project Scheduling with Task Durations and Costs That May Increase Over Time: Demonstrated with the U.S. Army Future Combat Systems. Storming Media, 2004.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Vivian, Bradford. Invention. Oxford University Press, 2017. http://dx.doi.org/10.1093/acprof:oso/9780190611088.003.0002.

Pełny tekst źródła
Streszczenie:
Chapter 1 uses a historical, and notably unconventional, example of witnessing to demonstrate how bearing witness involves sometimes radical and purposeful rhetorical invention (or reinvention) of historical fact. In his Cotton States Exposition Address (1895), Booker T. Washington, a former slave, romanticized the pre–Civil War South with curious irony. This counterintuitive example indicates that witnesses bear witness in public only if social, political, or moral authorities permit their testimonies. In Washington’s case, the authorities in question presided over the economic and political institutions of the post-Reconstruction South. Witnesses are either broadly empowered or narrowly constrained in their ability to invent a version of the past that presiding officials and the public at large may welcome, according to existing standards of decorum or conventions of praise and blame. Witnessing, this chapter argues, is rhetorically inventive insofar as witnesses testify by appearing to present unmediated recollections of the past; yet such apparently unmediated accounts are effects of rhetorical invention constrained by the dictates of immediate sociopolitical hierarchies.
Style APA, Harvard, Vancouver, ISO itp.
9

Roach, Lee. 11. Public regulation of land. Oxford University Press, 2013. http://dx.doi.org/10.1093/he/9780199603794.003.0011.

Pełny tekst źródła
Streszczenie:
Titles in the Core Text series take the reader straight to the heart of the subject, providing focused, concise, and reliable guides for students at all levels. A significant measure of socially beneficial control over land and the local environment is achieved through various forms of state-imposed regulation. This chapter, which discusses how estate ownership is constrained by conceptions of stewardship in the public interest, examines the law and context surrounding some of the most far-reaching forms of state intervention in the area of land: control of land use and takings of land.
Style APA, Harvard, Vancouver, ISO itp.
10

Roof, Tracy. Interest Groups. Redaktorzy Daniel Béland, Kimberly J. Morgan i Christopher Howard. Oxford University Press, 2014. http://dx.doi.org/10.1093/oxfordhb/9780199838509.013.034.

Pełny tekst źródła
Streszczenie:
This chapter examines the role of interest groups in shaping American social welfare policy. It outlines major theories and findings on interest group influence in American politics and comparative welfare state development and examines the activities and influence of major categories of groups, including business, labor, agriculture, professional associations, intergovernmental organizations, and citizens’ groups. Although many interest groups have helped secure policies that form a limited social safety net, this chapter suggests that the competition among a diverse array of interest groups in a fragmented political system makes policy change difficult. This tendency towards gridlock, which favors the interests of some groups over others, has constrained the size and redistribution of the American welfare state.
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Części książek na temat "Over-Constrained"

1

Jampel, Michael. "A brief overview of over-constrained systems". W Over-Constrained Systems, 1–22. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61479-6_16.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Borning, Alan, Bjorn Freeman-Benson i Molly Wilson. "Constraint hierarchies". W Over-Constrained Systems, 23–62. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61479-6_17.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Freuder, Eugene C., i Richard J. Wallace. "Partial constraint satisfaction". W Over-Constrained Systems, 63–110. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61479-6_18.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Bistarelli, Stefano, Hélène Faxgier, Ugo Montanari, Francesca Rossi, Thomas Schiex i Gérard Verfaillie. "Semiring-based CSPs and valued CSPs: Basic properties and comparison". W Over-Constrained Systems, 111–50. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61479-6_19.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Menezes, Francisco, i Pedro Barahona. "Defeasible constraint solving". W Over-Constrained Systems, 151–70. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61479-6_20.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Wolf, Armin. "Transforming ordered constraint hierarchies into ordinary constraint systems". W Over-Constrained Systems, 171–87. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61479-6_21.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Jampel, Michael. "A compositional theory of constraint hierarchies (Operational semantics)". W Over-Constrained Systems, 189–206. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61479-6_22.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Wallace, Richard J., i Eugene C. Freuder. "Heuristic methods for over-constrained constraint satisfaction problems". W Over-Constrained Systems, 207–16. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61479-6_23.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Wallace, Richard J. "Cascaded directed arc consistency and no-good learning for the maximal constraint satisfaction problem". W Over-Constrained Systems, 217–27. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61479-6_24.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Dendris, Nick D., Lefteris M. Kirousis, Yannis C. Stamatiou i Dimitris M. Thilikos. "Partial arc consistency". W Over-Constrained Systems, 229–36. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61479-6_25.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.

Streszczenia konferencji na temat "Over-Constrained"

1

Betti, Alessandro, Marco Gori, Simone Marullo i Stefano Melacci. "Developing Constrained Neural Units Over Time". W 2020 International Joint Conference on Neural Networks (IJCNN). IEEE, 2020. http://dx.doi.org/10.1109/ijcnn48605.2020.9207028.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Qu, Qiang, Hongyan Li, Lei Wang, Gaoshan Miao i Xin Wei. "Online Constrained Pattern Detection over Streams". W 2009 Sixth International Conference on Fuzzy Systems and Knowledge Discovery. IEEE, 2009. http://dx.doi.org/10.1109/fskd.2009.17.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Mencia, Carlos, i Joao Marques-Silva. "Efficient Relaxations of Over-constrained CSPs". W 2014 IEEE 26th International Conference on Tools with Artificial Intelligence (ICTAI). IEEE, 2014. http://dx.doi.org/10.1109/ictai.2014.113.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Lin, Jin-xian, i Jing-jing Wei. "Constrained Skyline Computing over Data Streams". W 2008 IEEE International Conference on e-Business Engineering. IEEE, 2008. http://dx.doi.org/10.1109/icebe.2008.45.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Srivastava, Kunal, Angelia Nedic i Dusan M. Stipanovic. "Distributed constrained optimization over noisy networks". W 2010 49th IEEE Conference on Decision and Control (CDC). IEEE, 2010. http://dx.doi.org/10.1109/cdc.2010.5717947.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Spiewak, Swavik, Arjun Selvakumar, Mehdi Tabe Arjmand i Eric Lawrence. "Dynamics of Mechanically Over-Constrained Inertial Sensors". W ASME 2010 International Mechanical Engineering Congress and Exposition. ASMEDC, 2010. http://dx.doi.org/10.1115/imece2010-40692.

Pełny tekst źródła
Streszczenie:
Microsystems Technology based inertial sensors offer important advantages in low-invasive measurement of spatial motion with sub-micron accuracy. Their successful implementation hinges upon achieving very low distortion and noise at the low end of the frequency spectrum. Of particular importance is the Vibration Rectification Error (VRE) — an apparent shift in the signal bias that occurs when inertial sensors are subjected to vibration. A common approach to the reduction of VRE is assuring a highly symmetrical mechanical structure of sensors. Furthermore, a low cross-axis sensitivity is desirable. In accelerometers these properties are achieved by employing multiple flexures supporting the seismic mass. However, this may lead to mechanical over-constraining and multiple local equilibria rather than a single global one. Multiple equilibria combined with the nonlinearity of flexures create conditions for chaotic behavior, which can greatly degrade the sensors’ performance. We investigate representative architectures of high performance servo accelerometers, study the impact of over-constraining, and develop comprehensive dynamic models accounting for the presence of this condition. Given the complexity of spatial motion of the proof mass and resulting deformations in the flexures, we employ computer aided generation of constitutive, symbolic and scaleable models of the investigated sensors. We illustrate analytical investigations with numerical simulations and experimental results.
Style APA, Harvard, Vancouver, ISO itp.
7

Domagalski, Daniel G. "Kinematic Simulation Modeling of Over-Constrained Suspensions". W SAE 2006 World Congress & Exhibition. 400 Commonwealth Drive, Warrendale, PA, United States: SAE International, 2006. http://dx.doi.org/10.4271/2006-01-0561.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Ting, Kwun-Lon, i Kuan-Lun Hsu. "Over-Constrained Mechanisms Derived From RPRP Loops". W ASME 2018 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2018. http://dx.doi.org/10.1115/detc2018-85030.

Pełny tekst źródła
Streszczenie:
This paper addresses the assembly strategy capable of deriving a family of over-constrained mechanisms systematically. The modular approach is proposed. It treats the topological synthesis of over-constrained mechanisms as a systematical derivation rather than a random search. The result indicates that a family of over-constrained mechanisms can be constructed by combining legitimate modules. A spatial four-bar linkage containing two revolute joints (R) and two prismatic joints (P) is selected as the source-module for the purpose of demonstration. All mechanisms discovered in this paper were modeled and animated with computer aided design (CAD) software and their mobility were validated with input-output equations as well as computer simulations. The assembly strategy can serve as a self-contained library of over-constrained mechanisms.
Style APA, Harvard, Vancouver, ISO itp.
9

Naidu, K. V. M., Rajeev Rastogi, Scott Satkin i Anand Srinivasan. "Memory-constrained aggregate computation over data streams". W 2011 IEEE International Conference on Data Engineering (ICDE 2011). IEEE, 2011. http://dx.doi.org/10.1109/icde.2011.5767860.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Horan, John, i Barry O'Sullivan. "Towards Diverse Relaxations of Over-Constrained Models". W 2009 21st IEEE International Conference on Tools with Artificial Intelligence (ICTAI). IEEE, 2009. http://dx.doi.org/10.1109/ictai.2009.89.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.

Raporty organizacyjne na temat "Over-Constrained"

1

Bormann, C., S. Lemay, H. Tschofenig, K. Hartke i B. Silverajan. CoAP (Constrained Application Protocol) over TCP, TLS, and WebSockets. Redaktor B. Raymor. RFC Editor, luty 2018. http://dx.doi.org/10.17487/rfc8323.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

van der Stok, P., P. Kampanakis, M. Richardson i S. Raza. EST-coaps: Enrollment over Secure Transport with the Secure Constrained Application Protocol. RFC Editor, kwiecień 2022. http://dx.doi.org/10.17487/rfc9148.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Dudhia, Jimy. Study of Multi-Scale Cloud Processes Over the Tropical Western Pacific Using Cloud-Resolving Models Constrained by Satellite Data. Office of Scientific and Technical Information (OSTI), marzec 2013. http://dx.doi.org/10.2172/1068146.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Lucas, Richard E. Comparing global reports of subjective well-being to experiential measures. Verlag der Österreichischen Akademie der Wissenschaften, czerwiec 2021. http://dx.doi.org/10.1553/populationyearbook2021.rev01.

Pełny tekst źródła
Streszczenie:
Subjective well-being (SWB) is an overall evaluation of the quality of a person’slife from his or her own perspective. One common method of assessing thisconstruct requires respondents to think about their life as a whole and to providea “global” evaluation that summarizes across life domains or affective experiencesover extended periods of time. The validity of these global measures has beenchallenged, however; and experiential measures, which ask respondents to reporton their momentary evaluative experiences many times over a constrained timeperiod, have been suggested as a more valid alternative. This paper addresses theempirical evidence for one important challenge to global measures: the possibilitythat temporarily salient information overwhelmingly influences global judgments,reducing their reliability and validity. This paper critiques prior evidence for thischallenge and presents new concerns about the assumed validity of the proposedalternative: experiential measures.
Style APA, Harvard, Vancouver, ISO itp.
5

Mdoe, Ntengua, Aida Isinika, Gilead Mlay, Gideon Boniface, Christopher Magomba, John Jeckoniah i Devotha Mosha. Is Rice and Sunflower Commercialisation in Tanzania Inclusive for Women and Youth? Institute of Development Studies (IDS), kwiecień 2022. http://dx.doi.org/10.19088/apra.2022.016.

Pełny tekst źródła
Streszczenie:
Rice is Tanzania’s third most important staple crop after maize and cassava, and produced by more than 1 million households who are mostly small-scale farmers. Meanwhile sunflower is the most important edible oil crop in Tanzania, also grown mostly by small-scale farmers. Over the last two decades, rice and sunflower have increasingly become important sources of income. This can be attributed to efforts by the government, in collaboration with development agencies, to commercialise rice and sunflower production to improve livelihoods and reduce poverty among actors in both value chains. There have also been efforts aimed at ensuring sustainable commercialisation and involvement of women and youth in the commercialisation process. Despite these initiatives, women and youth involvement in the rice and sunflower commercialisation process is likely to be constrained by their limited access to land and financial capital. Looking at government policy to promote commercial rice and sunflower production for poverty reduction, this brief examines the extent to which households headed by women and youth have been able to participate in the commercialisation process of the two value chains.
Style APA, Harvard, Vancouver, ISO itp.
6

Ferguson, Thomas, i Servaas Storm. Myth and Reality in the Great Inflation Debate: Supply Shocks and Wealth Effects in a Multipolar World Economy. Institute for New Economic Thinking Working Paper Series, styczeń 2023. http://dx.doi.org/10.36687/inetwp196.

Pełny tekst źródła
Streszczenie:
This paper critically evaluates debates over the causes of U.S. inflation. We first show that claims that the Biden stimulus was the major cause of inflation are mistaken: the key data series – stimulus spending and inflation – move dramatically out of phase. While the first ebbs quickly, the second persistently surges. We then look at alternative explanations of the price rises. We assess four supply side factors: imports, energy prices, rises in corporate profit margins, and COVID. We argue that discussions of COVID’s impact have thus far only tangentially acknowledged the pandemic’s far-reaching effects on labor markets. We conclude that while all four factors played roles in bringing on and sustaining inflation, they cannot explain all of it. There really is an aggregate demand problem. But the surprise surge in demand did not arise from government spending. It came from the unprecedented gains in household wealth, particularly for the richest 10% of households, which we show powered the recovery of aggregate US consumption expenditure especially from July 2021. The final cause of the inflationary surge in the U.S., therefore, was in large measure the unequal (wealth) effects of ultra-loose monetary policy during 2020-2021. This conclusion is important because inflationary pressures are unlikely to subside soon. Going forward, COVID, war, climate change, and the drift to a belligerently multipolar world system are all likely to strain global supply chains. Our conclusion outlines how policy has to change to deal with the reality of steady, but irregular supply shocks. This type of inflation responds only at enormous cost to monetary policies, because it arises mostly from supply-side difficulties that require targeted solutions. But when supply plummets or becomes more variable, fiscal policy also has to adapt: existing explorations of ways to steady demand over the business cycle have to embrace much bolder macroeconomic measures to control over-spending when supply is temporarily constrained.
Style APA, Harvard, Vancouver, ISO itp.
7

Howard, Jo, Evert-jan Quak i Jim Woodhill. A Practical Approach for Supporting Learning in Development Organisations. Institute of Development Studies, wrzesień 2022. http://dx.doi.org/10.19088/k4d.2022.120.

Pełny tekst źródła
Streszczenie:
The Knowledge, Evidence and Learning for Development (K4D) Programme, which started in 2016, comes to an end in September 2022. K4D is a programme funded by and for the UK Government’s Foreign, Commonwealth and Development Office (initially with the Department for International Development, DFID, which was merged with the FCO in 2020). To reflect on the processes and approaches of learning that K4D enabled over the years, a special Working Paper series will be published. One important pillar of the programme was to facilitate learning processes through learning journeys. A total of 33 learning journeys took place during K4D. This summary looks back at the K4D concept, the learning journeys, the learning processes it supported, and the outcomes enabled. The paper finds that there is evidence that K4D learning journeys have helped enable sound, informed decision-making through collective understanding of issues and options, and through internal consensus on directions. Effective learning spaces were created and the methods used (including online tools for participation) were able to capture and share internal learning, foster internal connections, present external evidence and bring in other perspectives. However, success in enabling external alliances for decisions and change was more constrained, since most learning journeys engaged only in limited ways with external organisations. Further challenges were encountered when staff were redeployed to respond to political (Brexit) or international development (COVID-19, Ukraine) priorities.
Style APA, Harvard, Vancouver, ISO itp.
8

Cusbert, Tom. The Effect of Credit Constraints on Housing Prices: (Further) Evidence from a Survey Experiment. Reserve Bank of Australia, styczeń 2023. http://dx.doi.org/10.47688/rdp2023-01.

Pełny tekst źródła
Streszczenie:
The response of housing prices to financing conditions is determined by the effect on the marginal buyer, not the average household. I use heterogeneous willingness to pay (WTP) data from a stated preference experiment in Fuster and Zafar (2021) to estimate the effects of changes in mortgage rates and collateral constraints on housing prices by analysing the structure of housing demand curves. This work builds on their research, which focused on average changes in WTP. Relaxing down payment constraints has a large average effect on WTP, but the effect on price is less than half as large. Financially constrained households tend to respond more to relaxed constraints, but those households often have WTPs that are too low to affect market prices. Changing the mortgage rate has the same average effect on WTPs and on market prices, because there is no systematic relationship between a household's response to mortgage rates and their location on the demand curve. I use a heterogeneous user cost model of individual WTPs to understand how household heterogeneity determines the structure of overall housing demand. An empirical model using observable household characteristics allows the experimental findings to be applied to other household survey data to simulate the effects of credit conditions. The simulated effects of easing collateral constraints in Australia are fairly stable over the past 20 years, and show a similar pattern to the US results.
Style APA, Harvard, Vancouver, ISO itp.
9

Hendricks, Kasey. Data for Alabama Taxation and Changing Discourse from Reconstruction to Redemption. University of Tennessee, Knoxville Libraries, 2021. http://dx.doi.org/10.7290/wdyvftwo4u.

Pełny tekst źródła
Streszczenie:
At their most basic level taxes carry, in the words of Schumpeter ([1918] 1991), “the thunder of history” (p. 101). They say something about the ever-changing structures of social, economic, and political life. Taxes offer a blueprint, in both symbolic and concrete terms, for uncovering the most fundamental arrangements in society – stratification included. The historical retellings captured within these data highlight the politics of taxation in Alabama from 1856 to 1901, including conflicts over whom money is expended upon as well as struggles over who carries their fair share of the tax burden. The selected timeline overlaps with the formation of five of six constitutions adopted in the State of Alabama, including 1861, 1865, 1868, 1875, and 1901. Having these years as the focal point makes for an especially meaningful case study, given how much these constitutional formations made the state a site for much political debate. These data contain 5,121 pages of periodicals from newspapers throughout the state, including: Alabama Sentinel, Alabama State Intelligencer, Alabama State Journal, Athens Herald, Daily Alabama Journal, Daily Confederation, Elyton Herald, Mobile Daily Tribune, Mobile Tribune, Mobile Weekly Tribune, Morning Herald, Nationalist, New Era, Observer, Tuscaloosa Observer, Tuskegee News, Universalist Herald, and Wilcox News and Pacificator. The contemporary relevance of these historical debates manifests in Alabama’s current constitution which was adopted in 1901. This constitution departs from well-established conventions of treating the document as a legal framework that specifies a general role of governance but is firm enough to protect the civil rights and liberties of the population. Instead, it stands more as a legislative document, or procedural straightjacket, that preempts through statutory material what regulatory action is possible by the state. These barriers included a refusal to establish a state board of education and enact a tax structure for local education in addition to debt and tax limitations that constrained government capacity more broadly. Prohibitive features like these are among the reasons that, by 2020, the 1901 Constitution has been amended nearly 1,000 times since its adoption. However, similar procedural barriers have been duplicated across the U.S. since (e.g., California’s Proposition 13 of 1978). Reference: Schumpeter, Joseph. [1918] 1991. “The Crisis of the Tax State.” Pp. 99-140 in The Economics and Sociology of Capitalism, edited by Richard Swedberg. Princeton University Press.
Style APA, Harvard, Vancouver, ISO itp.
Możesz być także zainteresowany rozszerzonymi bibliografiami na temat „Over-Constrained” dla poszczególnych typów źródeł:
Artykuły w czasopismach Rozprawy doktorskie Książki
Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!

Do bibliografii