Results 31 to 40 of about 46,397 (267)
An Integer Programming Approach to Solving Tantrix on Fixed Boards
Tantrix (Tantrix R ⃝ is a registered trademark of Colour of Strategy Ltd. in New Zealand, and of TANTRIX JAPAN in Japan, respectively, under the license of M.
Yushi Uno, Fumika Kino
doaj +1 more source
Simultaneous Combinatorial Game Theory
Combinatorial game theory (CGT), as introduced by Berlekamp, Conway and Guy, involves two players who move alternately in a perfect information, zero-sum game, and there are no chance devices. Also the games have the finite descent property (every game terminates in a finite number of moves). The two players are usually called Left and Right. The games
Huggan, Melissa +2 more
openaire +2 more sources
This paper proposes a distributed adaptive dynamic programming scheme to investigate the optimal tracking control problem for finite‐horizon non‐linear interconnected systems with constraint inputs under aperiodic sampling.
Dandan Duan, Chunsheng Liu
doaj +1 more source
From Nash Equilibria to Chain Recurrent Sets: An Algorithmic Solution Concept for Game Theory
In 1950, Nash proposed a natural equilibrium solution concept for games hence called Nash equilibrium, and proved that all finite games have at least one.
Christos Papadimitriou +1 more
doaj +1 more source
Supply chain management and optimization in transportation logistics
Supply chain management (SCM) is the decision-making process that steers numerous activities in order to generate added values for all stakeholders. The aim of this process is to optimize each activity in terms of advantageous profits to the suppliers ...
Saoussen Krichen
doaj +1 more source
Decentralized Auctioneerless Combinatorial Auctions for Multi-Unit Resource Allocation
Auction has been used to allocate resources or tasks to processes, machines, or other autonomous agents in distributed systems. Among various types of auctions, combinatorial auction (CA) allocates a bundle of items to each agent at once.
Li-Hsing Yen, Guang-Hong Sun
doaj +1 more source
Combinatorial Game Theory Foundations Applied to Digraph Kernels [PDF]
Known complexity facts: the decision problem of the existence of a kernel in a digraph $G=(V,E)$ is NP-complete; if all of the cycles of $G$ have even length, then $G$ has a kernel; and the question of the number of kernels is $\#$P-complete even for this restricted class of digraphs.
openaire +2 more sources
In the context of intelligent construction and building industrialization, assembly buildings face many challenges in quality management due to their special design and construction characteristics.
Qiao Sun +4 more
doaj +1 more source
We show that the majority of the 18 analyzed recurrent cancer‐associated ERBB4 mutations are transforming. The most potent mutations are activating, co‐operate with other ERBB receptors, and are sensitive to pan‐ERBB inhibitors. Activating ERBB4 mutations also promote therapy resistance in EGFR‐mutant lung cancer.
Veera K. Ojala +15 more
wiley +1 more source
Analysis and classification of fixed points of operators on a simplex
This paper investigates the dynamical behavior of Lotka–Volterra type operators defined on the four and five dimensional simplexes, focusing on their fixed points and structural representation through directed graphs (tournaments).
D.B. Eshmamatova, M.A. Tadzhieva
doaj +1 more source

