Filtry
wszystkich: 3073
-
Katalog
- Publikacje 2965 wyników po odfiltrowaniu
- Czasopisma 3 wyników po odfiltrowaniu
- Konferencje 1 wyników po odfiltrowaniu
- Osoby 21 wyników po odfiltrowaniu
- Wynalazki 2 wyników po odfiltrowaniu
- Projekty 1 wyników po odfiltrowaniu
- Laboratoria 1 wyników po odfiltrowaniu
- Kursy Online 44 wyników po odfiltrowaniu
- Wydarzenia 6 wyników po odfiltrowaniu
- Dane Badawcze 29 wyników po odfiltrowaniu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: problem allena-cahna
-
Asymmetric Renyi Problem and > PATRICIA Tries
PublikacjaIn 1960 R´enyi asked for the number of random queries necessary to recover a hidden bijective labeling of n distinct objects. In each query one selects a random subset of labels and asks, what is the set of objects that have theselabels? Weconsider here anasymmetric version of the problem in which in every query an object is chosenwith probability p > 1/2 and we ignore “inconclusive” queries. We study the number of queries needed...
-
The hat problem on cycles on at least nine vertices
PublikacjaThe topic is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of winning. In this version every player...
-
International Journal of Creativity and Problem Solving
Czasopisma -
Interdisciplinary Journal of Problem-Based Learning
Czasopisma -
An adaptive approach to the problem of collision avoiding at sea
PublikacjaW referacie przedstawiono koncepcję podejścia adaptacyjnego do unikania kolizji na morzu. Omawiany problem został sklasyfikowany jako problem uczenia się ze wzmocnieniem. Zamieszczono opis podstawowych technik uczenia się ze wzmocnieniem, ich ograniczeń i sposobu w jaki można zapewnić efektywne uczenie się, mimo wspomnianych ograniczeń. Zaprezentowana metoda została zilustrowana przykładowym procesem konstrukcji modelu i algorytmami...
-
Can we really solve an arch stability problem?
PublikacjaWe bring attention to the problem of solving nonlinear boundary-value problems for elastic structures such as arches and shells. Here we discuss a classical problem of a shear-deformable arch postbuckling. Considering a postbuckling behaviour of a circular arch we discuss the possibility to find numerically a solution for highly nonlinear regimes. The main attention is paid to the problem of determination of all solutions. The...
-
Selection Pressure in the Evolutionary Path Planning Problem
PublikacjaThis article compares an impact of using various post-selection methods on the selection pressure and the quality of the solution for the problem of planning the path for a moving object using the evolutionary method. The concept of selection pressure and different methods of post-selection are presented. Article analyses behaviour of post-selection for four options of evolutionary algorithms. Based on the results achieved, waveform...
-
The searchlight problem for road networks
PublikacjaWe consider the problem of searching for a mobile intruder hiding in a road network given as the union of two or more lines, or two or more line segments, in the plane. Some of the intersections of the road network are occupied by stationary guards equipped with a number of searchlights, each of which can emit a single ray of light in any direction along the lines (or line segments) it is on. The goal is to detect the intruder,...
-
Application of genetic algorithms in graph searching problem
PublikacjaGraph searching is a common approach to solving a problem of capturing a hostile intruder by a group of mobile agents. We assume that this task is performed in environment which we are able to model as a graph G. The question asked is how many agents are needed to capture an arbitrary fast, invisible and smart intruder. This number is called the (edge) search number of G. The strategy which must be performed by agents is called...
-
The Backbone Coloring Problem for Bipartite Backbones
PublikacjaLet G be a simple graph, H be its spanning subgraph and λ≥2 be an integer. By a λ -backbone coloring of G with backbone H we mean any function c that assigns positive integers to vertices of G in such a way that |c(u)−c(v)|≥1 for each edge uv∈E(G) and |c(u)−c(v)|≥λ for each edge uv∈E(H) . The λ -backbone chromatic number BBCλ(G,H) is the smallest integer k such that there exists a λ -backbone coloring c of G with backbone H satisfying...
-
Parallel tabu search for graph coloring problem
PublikacjaTabu search is a simple, yet powerful meta-heuristic based on local search that has been often used to solve combinatorial optimization problems like the graph coloring problem. This paper presents current taxonomy of patallel tabu search algorithms and compares three parallelization techniques applied to Tabucol, a sequential TS algorithm for graph coloring. The experimental results are based on graphs available from the DIMACS...
-
CLASSIFICATION OF RESTRAINTS IN THE OPTIMIZATION PROBLEM OF A COLD-FORMED PROFILE
PublikacjaThis work describes the restraints in the optimization problem. This is an important and complicated issue because it requires taking into account a vast range of information related to the design and production. In order to describe the relations of a specific optimization problem, it is essential to adopt appropriate criteria and to collect information on all kinds of restraints, i.e. boundary conditions. The following paper...
-
The Protein Folding Problem
Publikacja -
Problem powodzi miejskich
PublikacjaZagadnienia związane z powtarzającym się w Polsce zjawiskiem powodzi miejskiej pochodzącej od opadu. Problemy ocen ilościowych. Zagadnienie nadmiernego wpływu przeszłości na podejmowane działania, w efekcie niewłaściwa identyfikacja problemów. Przykład działań podjętych w Gdańsku. Inicjatywa bydgoska.
-
The Snow Team Problem
PublikacjaWe study several problems of clearing subgraphs by mobile agents in digraphs. The agents can move only along directed walks of a digraph and, depending on the variant, their initial positions may be pre-specified. In general, for a given subset~$\cS$ of vertices of a digraph $D$ and a positive integer $k$, the objective is to determine whether there is a subgraph $H=(\cV_H,\cA_H)$ of $D$ such that (a) $\cS \subseteq \cV_H$, (b)...
-
Two-criteria optimisation problem for ventral hernia repair
PublikacjaTwo-criteria optimisation problem related to laparoscopic ventral hernia repair is formulated in this paper. An optimal implant from a given set and its orientation is sought. The implant is subjected to kinematic extortions due to a patient’s body movement and intra-abdominal pressure. The first criterion of the optimisation problem deals with the reaction force in the implant fastener, while the deflection of the implant constitutes...
-
Evolutionary Sets of Safe Ship Trajectories: problem dedicated operators
PublikacjaThe paper presents the optimization process of the evolutionary sets of safe ship trajectories method, with a focus on its problem-dedicated operators. The method utilizes a customized evolutionary algorithm to solve a constrained optimization problem. This problem is defined as finding a set of cooperating trajectories (a set is an evolutionary individual) of all the ships involved in the encounter situation. The resulting trajectories...
-
A construction for the hat problem on a directed graph
PublikacjaA team of n players plays the following game. After a strategy session, each player is randomly fitted with a blue or red hat. Then, without further communication, everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. Visibility is defined by a directed graph; that is, vertices correspond to players, and a player can see each player to whom he is connected by an arc. The...
-
Density smoothness estimation problem using a wavelet approach
PublikacjaIn this paper we consider a smoothness parameter estimation problem for a density function. The smoothness parameter of a function is defined in terms of Besov spaces. This paper is an extension of recent results (K. Dziedziul, M. Kucharska, B. Wolnik, Estimation of the smoothness parameter ). The construction of the estimator is based on wavelets coefficients. Although we believe that the effective estimation of the smoothness...
-
GreedyMAX-type Algorithms for the Maximum Independent Set Problem
PublikacjaA maximum independent set problem for a simple graph G = (V,E) is to find the largest subset of pairwise nonadjacent vertices. The problem is known to be NP-hard and it is also hard to approximate. Within this article we introduce a non-negative integer valued functionp defined on the vertex set V(G) and called a potential function of agraph G, while P(G) = max{vinV(G)| p(v)} is called a potential of G. For any graph P(G) <= D(G),...