Literatura académica sobre el tema "Over-Constrained"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Over-Constrained".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Artículos de revistas sobre el tema "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.
Texto completoBoylu, Fidan, Haldun Aytug y Gary J. Koehler. "Induction over constrained strategic agents". European Journal of Operational Research 203, n.º 3 (junio de 2010): 698–705. http://dx.doi.org/10.1016/j.ejor.2009.09.028.
Texto completoAbaid, Nicole y Maurizio Porfiri. "Consensus Over Numerosity-Constrained Random Networks". IEEE Transactions on Automatic Control 56, n.º 3 (marzo de 2011): 649–54. http://dx.doi.org/10.1109/tac.2010.2092270.
Texto completoZhan Shu y Richard H. Middleton. "Stabilization Over Power-Constrained Parallel Gaussian Channels". IEEE Transactions on Automatic Control 56, n.º 7 (julio de 2011): 1718–24. http://dx.doi.org/10.1109/tac.2011.2135270.
Texto completoShew, P. W. y P. Y. Hsiao. "Planar constrained terminals over-the-cell router". IEE Proceedings - Computers and Digital Techniques 144, n.º 2 (1997): 121. http://dx.doi.org/10.1049/ip-cdt:19971157.
Texto completoLim, A., B. Rodrigues, R. Thangarajoo y F. Xiao. "A Hybrid Framework for Over-Constrained Generalized". Artificial Intelligence Review 22, n.º 3 (noviembre de 2004): 211–43. http://dx.doi.org/10.1007/s10462-004-1286-8.
Texto completoDing, H., A. Lim, B. Rodrigues y Y. Zhu. "The over-constrained airport gate assignment problem". Computers & Operations Research 32, n.º 7 (julio de 2005): 1867–80. http://dx.doi.org/10.1016/j.cor.2003.12.003.
Texto completoChen, Yueting, Nick Koudas, Xiaohui Yu y Ziqiang Yu. "Spatial and temporal constrained ranked retrieval over videos". Proceedings of the VLDB Endowment 15, n.º 11 (julio de 2022): 3226–39. http://dx.doi.org/10.14778/3551793.3551865.
Texto completoPezzutto, M., E. Garone y L. Schenato. "Reference Governor for Constrained Control Over Lossy Channels". IEEE Control Systems Letters 4, n.º 2 (abril de 2020): 271–76. http://dx.doi.org/10.1109/lcsys.2019.2924411.
Texto completoSideris, Athanasios y Héctor Rotstein. "Constrained $H_infty$ Optimal Control over an Infinite Horizon". SIAM Journal on Control and Optimization 35, n.º 4 (julio de 1997): 1244–62. http://dx.doi.org/10.1137/s0363012995256898.
Texto completoTesis sobre el tema "Over-Constrained"
Beaumont, Matthew y 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.
Texto completoMahanta, 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.
Texto completoBeaumont, Matthew. "Handling Over-Constrained Temporal Constraint Networks". Thesis, Griffith University, 2004. http://hdl.handle.net/10072/366603.
Texto completoThesis (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.
Texto completoYu, 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.
Texto completoThis 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 y 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.
Texto completoNesh-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.
Texto completoDagens 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.
Texto completoBain, Stuart. "Evolving Algorithms for Over-Constrained and Satisfaction Problems". Thesis, Griffith University, 2007. http://hdl.handle.net/10072/365848.
Texto completoThesis (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.
Texto completoLibros sobre el tema "Over-Constrained"
Jampel, Michael, Eugene Freuder y Michael Maher, eds. Over-Constrained Systems. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61479-6.
Texto completoMichael, Jampel, Freuder Eugene C, Maher Michael 1959- y CP '95 (1995 : Cassis, France), eds. Over-constrained systems. Berlin: Springer, 1996.
Buscar texto completoLiu, Qinyuan, Zidong Wang y 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.
Texto completoMahvidi, Hamid. Performance of latency constrained turbo-like codes over correlated fading channels. Ottawa: National Library of Canada, 2000.
Buscar texto completoWang, Zidong, Qinyuan Liu y Xiao He. Stochastic Control and Filtering over Constrained Communication Networks. Springer, 2019.
Buscar texto completoWang, Zidong, Qinyuan Liu y Xiao He. Stochastic Control and Filtering over Constrained Communication Networks. Springer, 2018.
Buscar texto completoCost-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.
Buscar texto completoVivian, Bradford. Invention. Oxford University Press, 2017. http://dx.doi.org/10.1093/acprof:oso/9780190611088.003.0002.
Texto completoRoach, Lee. 11. Public regulation of land. Oxford University Press, 2013. http://dx.doi.org/10.1093/he/9780199603794.003.0011.
Texto completoRoof, Tracy. Interest Groups. Editado por Daniel Béland, Kimberly J. Morgan y Christopher Howard. Oxford University Press, 2014. http://dx.doi.org/10.1093/oxfordhb/9780199838509.013.034.
Texto completoCapítulos de libros sobre el tema "Over-Constrained"
Jampel, Michael. "A brief overview of over-constrained systems". En Over-Constrained Systems, 1–22. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61479-6_16.
Texto completoBorning, Alan, Bjorn Freeman-Benson y Molly Wilson. "Constraint hierarchies". En Over-Constrained Systems, 23–62. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61479-6_17.
Texto completoFreuder, Eugene C. y Richard J. Wallace. "Partial constraint satisfaction". En Over-Constrained Systems, 63–110. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61479-6_18.
Texto completoBistarelli, Stefano, Hélène Faxgier, Ugo Montanari, Francesca Rossi, Thomas Schiex y Gérard Verfaillie. "Semiring-based CSPs and valued CSPs: Basic properties and comparison". En Over-Constrained Systems, 111–50. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61479-6_19.
Texto completoMenezes, Francisco y Pedro Barahona. "Defeasible constraint solving". En Over-Constrained Systems, 151–70. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61479-6_20.
Texto completoWolf, Armin. "Transforming ordered constraint hierarchies into ordinary constraint systems". En Over-Constrained Systems, 171–87. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61479-6_21.
Texto completoJampel, Michael. "A compositional theory of constraint hierarchies (Operational semantics)". En Over-Constrained Systems, 189–206. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61479-6_22.
Texto completoWallace, Richard J. y Eugene C. Freuder. "Heuristic methods for over-constrained constraint satisfaction problems". En Over-Constrained Systems, 207–16. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61479-6_23.
Texto completoWallace, Richard J. "Cascaded directed arc consistency and no-good learning for the maximal constraint satisfaction problem". En Over-Constrained Systems, 217–27. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61479-6_24.
Texto completoDendris, Nick D., Lefteris M. Kirousis, Yannis C. Stamatiou y Dimitris M. Thilikos. "Partial arc consistency". En Over-Constrained Systems, 229–36. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61479-6_25.
Texto completoActas de conferencias sobre el tema "Over-Constrained"
Betti, Alessandro, Marco Gori, Simone Marullo y Stefano Melacci. "Developing Constrained Neural Units Over Time". En 2020 International Joint Conference on Neural Networks (IJCNN). IEEE, 2020. http://dx.doi.org/10.1109/ijcnn48605.2020.9207028.
Texto completoQu, Qiang, Hongyan Li, Lei Wang, Gaoshan Miao y Xin Wei. "Online Constrained Pattern Detection over Streams". En 2009 Sixth International Conference on Fuzzy Systems and Knowledge Discovery. IEEE, 2009. http://dx.doi.org/10.1109/fskd.2009.17.
Texto completoMencia, Carlos y Joao Marques-Silva. "Efficient Relaxations of Over-constrained CSPs". En 2014 IEEE 26th International Conference on Tools with Artificial Intelligence (ICTAI). IEEE, 2014. http://dx.doi.org/10.1109/ictai.2014.113.
Texto completoLin, Jin-xian y Jing-jing Wei. "Constrained Skyline Computing over Data Streams". En 2008 IEEE International Conference on e-Business Engineering. IEEE, 2008. http://dx.doi.org/10.1109/icebe.2008.45.
Texto completoSrivastava, Kunal, Angelia Nedic y Dusan M. Stipanovic. "Distributed constrained optimization over noisy networks". En 2010 49th IEEE Conference on Decision and Control (CDC). IEEE, 2010. http://dx.doi.org/10.1109/cdc.2010.5717947.
Texto completoSpiewak, Swavik, Arjun Selvakumar, Mehdi Tabe Arjmand y Eric Lawrence. "Dynamics of Mechanically Over-Constrained Inertial Sensors". En ASME 2010 International Mechanical Engineering Congress and Exposition. ASMEDC, 2010. http://dx.doi.org/10.1115/imece2010-40692.
Texto completoDomagalski, Daniel G. "Kinematic Simulation Modeling of Over-Constrained Suspensions". En SAE 2006 World Congress & Exhibition. 400 Commonwealth Drive, Warrendale, PA, United States: SAE International, 2006. http://dx.doi.org/10.4271/2006-01-0561.
Texto completoTing, Kwun-Lon y Kuan-Lun Hsu. "Over-Constrained Mechanisms Derived From RPRP Loops". En 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.
Texto completoNaidu, K. V. M., Rajeev Rastogi, Scott Satkin y Anand Srinivasan. "Memory-constrained aggregate computation over data streams". En 2011 IEEE International Conference on Data Engineering (ICDE 2011). IEEE, 2011. http://dx.doi.org/10.1109/icde.2011.5767860.
Texto completoHoran, John y Barry O'Sullivan. "Towards Diverse Relaxations of Over-Constrained Models". En 2009 21st IEEE International Conference on Tools with Artificial Intelligence (ICTAI). IEEE, 2009. http://dx.doi.org/10.1109/ictai.2009.89.
Texto completoInformes sobre el tema "Over-Constrained"
Bormann, C., S. Lemay, H. Tschofenig, K. Hartke y B. Silverajan. CoAP (Constrained Application Protocol) over TCP, TLS, and WebSockets. Editado por B. Raymor. RFC Editor, febrero de 2018. http://dx.doi.org/10.17487/rfc8323.
Texto completovan der Stok, P., P. Kampanakis, M. Richardson y S. Raza. EST-coaps: Enrollment over Secure Transport with the Secure Constrained Application Protocol. RFC Editor, abril de 2022. http://dx.doi.org/10.17487/rfc9148.
Texto completoDudhia, 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), marzo de 2013. http://dx.doi.org/10.2172/1068146.
Texto completoLucas, Richard E. Comparing global reports of subjective well-being to experiential measures. Verlag der Österreichischen Akademie der Wissenschaften, junio de 2021. http://dx.doi.org/10.1553/populationyearbook2021.rev01.
Texto completoMdoe, Ntengua, Aida Isinika, Gilead Mlay, Gideon Boniface, Christopher Magomba, John Jeckoniah y Devotha Mosha. Is Rice and Sunflower Commercialisation in Tanzania Inclusive for Women and Youth? Institute of Development Studies (IDS), abril de 2022. http://dx.doi.org/10.19088/apra.2022.016.
Texto completoFerguson, Thomas y 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, enero de 2023. http://dx.doi.org/10.36687/inetwp196.
Texto completoHoward, Jo, Evert-jan Quak y Jim Woodhill. A Practical Approach for Supporting Learning in Development Organisations. Institute of Development Studies, septiembre de 2022. http://dx.doi.org/10.19088/k4d.2022.120.
Texto completoCusbert, Tom. The Effect of Credit Constraints on Housing Prices: (Further) Evidence from a Survey Experiment. Reserve Bank of Australia, enero de 2023. http://dx.doi.org/10.47688/rdp2023-01.
Texto completoHendricks, 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.
Texto completo