Zaloguj się

Gotowe bibliografie tematyczne / Over-Constrained / Artykuły w czasopismach

Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Over-Constrained.

Artykuły w czasopismach 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:

Sprawdź 50 najlepszych artykułów w czasopismach 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.

Przeglądaj artykuły w czasopismach z różnych dziedzin i twórz odpowiednie bibliografie.

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, and Gary J. Koehler. "Induction over constrained strategic agents." European Journal of Operational Research 203, no. 3 (June 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, and Maurizio Porfiri. "Consensus Over Numerosity-Constrained Random Networks." IEEE Transactions on Automatic Control 56, no. 3 (March 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 and Richard H. Middleton. "Stabilization Over Power-Constrained Parallel Gaussian Channels." IEEE Transactions on Automatic Control 56, no. 7 (July 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., and P. Y. Hsiao. "Planar constrained terminals over-the-cell router." IEE Proceedings - Computers and Digital Techniques 144, no. 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, and F. Xiao. "A Hybrid Framework for Over-Constrained Generalized." Artificial Intelligence Review 22, no. 3 (November 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, and Y. Zhu. "The over-constrained airport gate assignment problem." Computers & Operations Research 32, no. 7 (July 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, and Ziqiang Yu. "Spatial and temporal constrained ranked retrieval over videos." Proceedings of the VLDB Endowment 15, no. 11 (July 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 (

Style APA, Harvard, Vancouver, ISO itp.

9

Pezzutto, M., E. Garone, and L. Schenato. "Reference Governor for Constrained Control Over Lossy Channels." IEEE Control Systems Letters 4, no. 2 (April 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, and Héctor Rotstein. "Constrained $H_infty$ Optimal Control over an Infinite Horizon." SIAM Journal on Control and Optimization 35, no. 4 (July 1997): 1244–62. http://dx.doi.org/10.1137/s0363012995256898.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

11

Pemberton, Joseph C. "Solving Over-Constrained Satellite Remote-Sensing Scheduling Problems." Electronic Notes in Discrete Mathematics 4 (January 2000): 54. http://dx.doi.org/10.1016/s1571-0653(05)80105-2.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

12

Casavola, Alessandro, Edoardo Mosca, and Maurizio Papini. "Teleoperation of constrained dynamical systems over the internet." IFAC Proceedings Volumes 33, no. 23 (September 2000): 281–86. http://dx.doi.org/10.1016/s1474-6670(17)36957-4.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

13

Mabire, Alrik, Philippe Serré, Mireille Moinet, Jean-François Rameau, and André Clément. "Computing clearances and deviations in over-constrained mechanisms." Procedia CIRP 75 (2018): 238–43. http://dx.doi.org/10.1016/j.procir.2018.04.070.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

14

Jiang, Tongsong, and Musheng Wei. "Equality constrained least squares problem over quaternion field." Applied Mathematics Letters 16, no. 6 (August 2003): 883–88. http://dx.doi.org/10.1016/s0893-9659(03)90012-7.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

15

Scutari, Gesualdo, and Ying Sun. "Distributed nonconvex constrained optimization over time-varying digraphs." Mathematical Programming 176, no. 1-2 (February 16, 2019): 497–544. http://dx.doi.org/10.1007/s10107-018-01357-w.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

16

Shi, Chong-Xiao, and Guang-Hong Yang. "Hierarchical constrained consensus algorithm over multi-cluster networks." Information Sciences 466 (October 2018): 189–202. http://dx.doi.org/10.1016/j.ins.2018.07.061.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

17

Argelich, Josep, and Felip Manyà. "Exact Max-SAT solvers for over-constrained problems." Journal of Heuristics 12, no. 4-5 (September 2006): 375–92. http://dx.doi.org/10.1007/s10732-006-7234-9.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

18

Abaid, Nicole, and Maurizio Porfiri. "Leader–follower consensus over numerosity-constrained random networks." Automatica 48, no. 8 (August 2012): 1845–51. http://dx.doi.org/10.1016/j.automatica.2012.05.058.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

19

Elitzur, S., A. Forge, and E. Rabinovici. "Comments on the importance of being over-constrained." Physics Letters B 289, no. 1-2 (September 1992): 45–50. http://dx.doi.org/10.1016/0370-2693(92)91359-h.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

20

Ye, Nijia, and Bo Hu. "Stiffness modeling of some 4-DOF over-constrained parallel manipulators with various constrained wrench forms." Mechanism and Machine Theory 172 (June 2022): 104821. http://dx.doi.org/10.1016/j.mechmachtheory.2022.104821.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

21

Li, Jufang, and Yan Chi. "An Efficient Local Search algorithm for Over-Constrained CSPs." IOP Conference Series: Earth and Environmental Science 267 (June 8, 2019): 042161. http://dx.doi.org/10.1088/1755-1315/267/4/042161.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

22

Braslavsky, Julio H., Richard H. Middleton, and James S. Freudenberg. "Feedback Stabilization Over Signal-to-Noise Ratio Constrained Channels." IEEE Transactions on Automatic Control 52, no. 8 (August 2007): 1391–403. http://dx.doi.org/10.1109/tac.2007.902739.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

23

Li, Wengen, Jihong Guan, Xiang Lian, Shuigeng Zhou, and Jiannong Cao. "Probabilistic Time-Constrained Paths Search over Uncertain Road Networks." IEEE Transactions on Services Computing 11, no. 2 (March 1, 2018): 399–414. http://dx.doi.org/10.1109/tsc.2016.2582692.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

24

Yan, J. –T. "Correspondence on ‘Planar constrained terminals over-the-cell router’." IEE Proceedings - Computers and Digital Techniques 145, no. 4 (1998): 319. http://dx.doi.org/10.1049/ip-cdt:19982096.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

25

Jasour, A. M., N. S. Aybat, and C. M. Lagoa. "Semidefinite Programming For Chance Constrained Optimization Over Semialgebraic Sets." SIAM Journal on Optimization 25, no. 3 (January 2015): 1411–40. http://dx.doi.org/10.1137/140958736.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

26

Fayet, M. "Distribution of Wrench-Twist Duality in Over-Constrained Mechanisms." Journal of Mechanical Design 125, no. 1 (March 1, 2003): 81–91. http://dx.doi.org/10.1115/1.1541629.

Pełny tekst źródła

Streszczenie:

First, a procedure is presented in order to build the space of statically admissible wrenches. The matrix which generates them is obtained in an intrinsic way. It uses intersection of spaces for the edges (of the associated graph) and the new operation of “triangular projection” for the vertices. From this matrix, the choice of any set of indeterminable contact forces is achieved via a very simple test. This matrix allows to determine also all the possible degrees of freedom to add to the over-constrained mechanism in order to transform it into a non over-constrained one. Wrench-twist duality

Style APA, Harvard, Vancouver, ISO itp.

27

Falsone, Alessandro, Kostas Margellos, Simone Garatti, and Maria Prandini. "Finite-Time Distributed Averaging Over Gossip-Constrained Ring Networks." IEEE Transactions on Control of Network Systems 5, no. 3 (September 2018): 879–87. http://dx.doi.org/10.1109/tcns.2017.2653418.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

28

Aysal, Tuncer Can, and Kenneth E. Barner. "Constrained Decentralized Estimation Over Noisy Channels for Sensor Networks." IEEE Transactions on Signal Processing 56, no. 4 (April 2008): 1398–410. http://dx.doi.org/10.1109/tsp.2007.909006.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

29

Ding, H., A. Lim, B. Rodrigues, and Y. Zhu. "New heuristics for over-constrained flight to gate assignments." Journal of the Operational Research Society 55, no. 7 (July 2004): 760–68. http://dx.doi.org/10.1057/palgrave.jors.2601736.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

30

Homri, Lazhar, Pierre Beaurepaire, Antoine Dumas, Edoh Goka, Nicolas Gayton, and Jean-Yves Dantan. "Statistical Tolerance Analysis Technique for Over-constrained Mechanical Systems." Procedia CIRP 75 (2018): 232–37. http://dx.doi.org/10.1016/j.procir.2018.04.047.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

31

Helton, J. William, Orlando Merino, and Trent E. Walker. "Optimization over analytic functions whose founrier coefficients are constrained." Integral Equations and Operator Theory 22, no. 4 (December 1995): 420–39. http://dx.doi.org/10.1007/bf01203384.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

32

Xu, Wei, Qing Ling, Yongcheng Li, and Manxi Wang. "Distributed constrained optimisation over cloud-based multi-agent networks." International Journal of Sensor Networks 28, no. 1 (2018): 43. http://dx.doi.org/10.1504/ijsnet.2018.094707.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

33

Wang, Manxi, Yongcheng Li, Qing Ling, and Wei Xu. "Distributed constrained optimisation over cloud-based multi-agent networks." International Journal of Sensor Networks 28, no. 1 (2018): 43. http://dx.doi.org/10.1504/ijsnet.2018.10015975.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

34

Marchiori, Elena, Massimo Marchiori, and Joost N. Kok. "A Novel Search Technique for Solving Over-Constrained Problems." International Journal on Artificial Intelligence Tools 06, no. 04 (December 1997): 587–611. http://dx.doi.org/10.1142/s0218213097000293.

Pełny tekst źródła

Streszczenie:

In many applications, such as decision support, negotiation, planning, scheduling, etc., one needs to express requirements that can be only partially satisfied. In order to express such requirements, we propose a technique called forward-tracking. Intuitively, forward-tracking is a kind of dual of chronological back-tracking: if a program globally fails to find a solution, then a new execution is started from a program point and a state 'forward' in the computation tree. This search technique is applied to the specific paradigm of constraint logic programming, obtaining a powerful extension th

Style APA, Harvard, Vancouver, ISO itp.

35

Dijksman, E. A. "Assembling Complete Pole Configurations for (Over)Constrained Planar Mechanisms." Journal of Mechanical Design 116, no. 1 (March 1, 1994): 215–25. http://dx.doi.org/10.1115/1.2919350.

Pełny tekst źródła

Streszczenie:

The complete pole configuration of a planar n-link mechanism having one instantaneous degree of mobility, possesses (3n−4)/2 independent poles determining (n−2)2/2 remaining poles of the configuration. The dependency is demonstrated through Desargues’ Theorem and her generalizations. Simultaneously, pole configurations have been “elated” into three-dimensional point-lattices intersected by a plane. The insight obtained in these configurations allows the designer to find clues in building overconstrained linkage mechanisms meeting certain geometrical properties.

Style APA, Harvard, Vancouver, ISO itp.

36

Raayatpanah, M. A., H. Salehi Fathabadi, H. Bahramgiri, and P. M. Pardalos. "Optimal-constrained multicast sub-graph over coded packet networks." Journal of Combinatorial Optimization 29, no. 4 (April 25, 2013): 723–38. http://dx.doi.org/10.1007/s10878-013-9617-9.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

37

García, Sonia C., Vincent Delos, and Denis Teissandier. "Sensitivity analysis for tolerance allocation of over-constrained mechanisms." Procedia CIRP 114 (2022): 123–28. http://dx.doi.org/10.1016/j.procir.2022.10.018.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

38

Liu, Xia, Luling An, Zhiguo Wang, Changbai Tan, and Xiaoping Wang. "Tolerance Analysis of Over-Constrained Assembly Considering Gravity Influence: Constraints of Multiple Planar Hole-Pin-Hole Pairs." Mathematical Problems in Engineering 2018 (November 14, 2018): 1–18. http://dx.doi.org/10.1155/2018/2039153.

Pełny tekst źródła

Streszczenie:

Over-constrained assembly of rigid parts is widely adopted in aircraft assembly to yield higher stiffness and accuracy of assembly. Unfortunately, the quantitative tolerance analysis of over-constrained assembly is challenging, subject to the coupling effect of geometrical and physical factors. Especially, gravity will affect the geometrical gaps in mechanical joints between different parts, and thus influence the deviations of assembled product. In the existing studies, the influence of gravity is not considered in the tolerance analysis of over-constrained assembly. This paper proposes a nov

Style APA, Harvard, Vancouver, ISO itp.

39

Gouveia, Luis, Luidi Simonetti, and Eduardo Uchoa. "Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs." Mathematical Programming 128, no. 1-2 (July 22, 2009): 123–48. http://dx.doi.org/10.1007/s10107-009-0297-2.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

40

Mahfoudhi, Farouk, Ashish Kumar Sultania, and Jeroen Famaey. "Over-the-Air Firmware Updates for Constrained NB-IoT Devices." Sensors 22, no. 19 (October 6, 2022): 7572. http://dx.doi.org/10.3390/s22197572.

Pełny tekst źródła

Streszczenie:

The Internet of Things (IoT) is being deployed to provide smart solutions for buildings, logistics, hospitals, and many more. It is growing with billions of connected devices. However, with such tremendous growth, maintenance and support are the hidden burdens. The devices deployed for IoT generally have a light microcontroller, low-power, low memory, and lightweight software. The software, which includes firmware and applications, can be managed remotely via a wireless connection. This improves flexibility, installation time, accessibility, effectiveness, and cost. The firmware can be updated

Style APA, Harvard, Vancouver, ISO itp.

41

Vidal, Cristian, Alexander Felfernig, José Galindo, Müslüm Atas, and David Benavides. "Explanations for over-constrained problems using QuickXPlain with speculative executions." Journal of Intelligent Information Systems 57, no. 3 (November 6, 2021): 491–508. http://dx.doi.org/10.1007/s10844-021-00675-4.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

42

Rojas, A. J. "Signal-to-Noise Ratio Constrained Feedback Control over Fading Channels." IFAC Proceedings Volumes 44, no. 1 (January 2011): 8799–804. http://dx.doi.org/10.3182/20110828-6-it-1002.00411.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

43

Greaves, Gary, and Jeven Syatriadi. "Reed–Solomon Codes Over Small Fields With Constrained Generator Matrices." IEEE Transactions on Information Theory 65, no. 8 (August 2019): 4764–70. http://dx.doi.org/10.1109/tit.2019.2897767.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

44

Kogiso, Kiminao, and Kenji Hirata. "Constrained Control Over Network by Index Feedback and Experimental Verification." Transactions of the Institute of Systems, Control and Information Engineers 26, no. 5 (2013): 156–64. http://dx.doi.org/10.5687/iscie.26.156.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

45

Le Thi, H. A., T. Pham Dinh, and L. D. Muu. "Simplicially-Constrained DC Optimization over Efficient and Weakly Efficient Sets." Journal of Optimization Theory and Applications 117, no. 3 (June 2003): 503–31. http://dx.doi.org/10.1023/a:1023993504522.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

46

Fong, B., G. Y. Hong, and A. C. M. Fong. "Constrained error propagation for efficient image transmission over noisy channels." IEEE Transactions on Consumer Electronics 48, no. 1 (February 2002): 49–55. http://dx.doi.org/10.1109/tce.2002.1010091.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

47

Guo, Sheng, Haibo Qu, Yuefa Fang, and Congzhe Wang. "THE DOF DEGENERATION CHARACTERISTICS OF CLOSED LOOP OVER-CONSTRAINED MECHANISMS." Transactions of the Canadian Society for Mechanical Engineering 36, no. 1 (March 2012): 67–82. http://dx.doi.org/10.1139/tcsme-2012-0005.

Pełny tekst źródła

Streszczenie:

A new teminology, “degenerative degrees of freedom”, to describe mechanisms possessing different degrees of freedom (DOF) while containing the same number of linkages and joints is introduced. A systematic approach is developed for studying this particular type of closed loop mechanism and its degeneration characteristics of DOFs. First, the single closed loop over-constrained mechanism is analyzed and a relationship between the number of over-constraints and the number of joints and DOFs is established. Then, all possible types of independent over-constraints and their combinations are summar

Style APA, Harvard, Vancouver, ISO itp.

48

Hu, Zhiwen, and Zhenhua Xu. "Optimal Power Constrained Distributed Detection over a Noisy Multiaccess Channel." Mathematical Problems in Engineering 2015 (2015): 1–7. http://dx.doi.org/10.1155/2015/580289.

Pełny tekst źródła

Streszczenie:

The problem of optimal power constrained distributed detection over a noisy multiaccess channel (MAC) is addressed. Under local power constraints, we define the transformation function for sensor to realize the mapping from local decision to transmitted waveform. The deflection coefficient maximization (DCM) is used to optimize the performance of power constrained fusion system. Using optimality conditions, we derive the closed-form solution to the considered problem. Monte Carlo simulations are carried out to evaluate the performance of the proposed new method. Simulation results show that th

Style APA, Harvard, Vancouver, ISO itp.

49

Maaroof, Omar W., and Mehmet İsmet Can Dede. "Kinematic synthesis of over-constrained double-spherical six-bar mechanism." Mechanism and Machine Theory 73 (March 2014): 154–68. http://dx.doi.org/10.1016/j.mechmachtheory.2013.10.013.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

50

Fernández Anta, Antonio, Chryssis Georgiou, Dariusz R. Kowalski, and Elli Zavou. "Adaptive packet scheduling over a wireless channel under constrained jamming." Theoretical Computer Science 692 (September 2017): 72–89. http://dx.doi.org/10.1016/j.tcs.2017.06.020.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

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!