Gotowa bibliografia na temat „Over-Constrained”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
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"
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łaBoylu, 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łaAbaid, 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łaZhan 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łaShew, 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łaLim, 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łaDing, 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łaChen, 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łaPezzutto, 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łaSideris, 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łaRozprawy doktorskie na temat "Over-Constrained"
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łaMahanta, 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łaBeaumont, Matthew. "Handling Over-Constrained Temporal Constraint Networks". Thesis, Griffith University, 2004. http://hdl.handle.net/10072/366603.
Pełny tekst źródłaThesis (PhD Doctorate)
Doctor of Philosophy (PhD)
Institute for Integrated and Intelligent Systems
Full Text
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łaYu, 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łaThis 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.
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łaNesh-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łaDagens 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.
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łaBain, Stuart. "Evolving Algorithms for Over-Constrained and Satisfaction Problems". Thesis, Griffith University, 2007. http://hdl.handle.net/10072/365848.
Pełny tekst źródłaThesis (PhD Doctorate)
Doctor of Philosophy (PhD)
School of Information and Communication Technology
Faculty of Engineering and Information Technology
Full Text
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łaKsiążki na temat "Over-Constrained"
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łaMichael, 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łaLiu, 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łaMahvidi, Hamid. Performance of latency constrained turbo-like codes over correlated fading channels. Ottawa: National Library of Canada, 2000.
Znajdź pełny tekst źródłaWang, Zidong, Qinyuan Liu i Xiao He. Stochastic Control and Filtering over Constrained Communication Networks. Springer, 2019.
Znajdź pełny tekst źródłaWang, Zidong, Qinyuan Liu i Xiao He. Stochastic Control and Filtering over Constrained Communication Networks. Springer, 2018.
Znajdź pełny tekst źródłaCost-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łaVivian, Bradford. Invention. Oxford University Press, 2017. http://dx.doi.org/10.1093/acprof:oso/9780190611088.003.0002.
Pełny tekst źródłaRoach, 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łaRoof, 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łaCzęści książek na temat "Over-Constrained"
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łaBorning, 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łaFreuder, 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łaBistarelli, 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łaMenezes, 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łaWolf, 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łaJampel, 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łaWallace, 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łaWallace, 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łaDendris, 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łaStreszczenia konferencji na temat "Over-Constrained"
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łaQu, 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łaMencia, 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łaLin, 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łaSrivastava, 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łaSpiewak, 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łaDomagalski, 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łaTing, 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łaNaidu, 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łaHoran, 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łaRaporty organizacyjne na temat "Over-Constrained"
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łavan 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łaDudhia, 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łaLucas, 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łaMdoe, 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łaFerguson, 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łaHoward, 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łaCusbert, 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łaHendricks, 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