Wyszukiwarka
Nie znaleźliśmy wyników w zadanych kryteriach!
Ale mamy wyniki w innych katalogach.Filtry
wszystkich: 6391
-
Katalog
- Publikacje 5414 wyników po odfiltrowaniu
- Czasopisma 17 wyników po odfiltrowaniu
- Konferencje 22 wyników po odfiltrowaniu
- Osoby 91 wyników po odfiltrowaniu
- Wynalazki 3 wyników po odfiltrowaniu
- Projekty 16 wyników po odfiltrowaniu
- Laboratoria 2 wyników po odfiltrowaniu
- Zespoły Badawcze 1 wyników po odfiltrowaniu
- Aparatura Badawcza 2 wyników po odfiltrowaniu
- Kursy Online 162 wyników po odfiltrowaniu
- Wydarzenia 16 wyników po odfiltrowaniu
- Oferty 1 wyników po odfiltrowaniu
- Dane Badawcze 644 wyników po odfiltrowaniu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: CONSTRAINED MODULUS
-
CONSTRAINTS
Czasopisma -
Young’s modulus distribution in the FEM models of bone tissue
PublikacjaThis paper presents how differences of Young’s modulus in adjacent finite elements typical for organic materials such as bone tissue, influence stress calculating. Emphasizing high computational cost of variable Young’s modulus in parts of the model, where the number of finite elements has been raised, the authors wants to prove that new model of finite element which has variable Young’s modulus in its volume needs to be created....
-
Resource constrained neural network training
PublikacjaModern applications of neural-network-based AI solutions tend to move from datacenter backends to low-power edge devices. Environmental, computational, and power constraints are inevitable consequences of such a shift. Limiting the bit count of neural network parameters proved to be a valid technique for speeding up and increasing efficiency of the inference process. Hence, it is understandable that a similar approach is gaining...
-
Simulation model for resource-constrained construction project
Publikacja -
Triangulation-based Constrained Surrogate Modeling of Antennas
PublikacjaDesign of contemporary antenna structures is heavily based on full-wave electromagnetic (EM) simulation tools. They provide accuracy but are CPU-intensive. Reduction of EM-driven design procedure cost can be achieved by using fast replacement models (surrogates). Unfortunately, standard modeling techniques are unable to ensure sufficient predictive power for real-world antenna structures (multiple parameters, wide parameter ranges,...
-
Impacts in case of triple unilaterally constrained system
PublikacjaThe this paper focus on the behaviour of a “rigid” body biting into another “rigid” body, with some nonzero relative velocity. In the presently considered case, the introduced collision appears between a selected element of a multibody structure and its reference body being interpreted as the motionless ground. Instead of the classic case, described in a number of dissertations, where a single impacting contact is considered, three...
-
Design-Oriented Constrained Modeling of Antenna Structures
PublikacjaFast surrogate models are crucially important to reduce the cost of design process of antenna structures. Due to curse of dimensionality, standard (data-driven) modeling methods exhibit serious limitations concerning the number of independent geometry parameters that can be handled but also (and even more importantly) their parameter ranges. In this work, a design-oriented modeling framework is proposed in which the surrogate is...
-
Adaptive resolution-constrained scalar multiple-description coding
Publikacja -
Collaborative Exploration of Trees by Energy-Constrained Mobile Robots
PublikacjaWe study the problem of exploration of a tree by mobile agents (robots) that have limited energy. The energy constraint bounds the number of edges that can be traversed by a single agent. We use a team of agents to collectively explore the tree and the objective is to minimize the size of this team. The agents start at a single node, the designated root of the tree and the height of the tree is assumed to be less than the energy...
-
Brief Announcement: Energy Constrained Depth First Search
PublikacjaDepth first search is a natural algorithmic technique for constructing a closed route that visits all vertices of a graph. The length of such route equals, in an edge-weighted tree, twice the total weight of all edges of the tree and this is asymptotically optimal over all exploration strategies. This paper considers a variant of such search strategies where the length of each route is bounded by a positive integer B (e.g. due...