Results 41 to 50 of about 39,168 (169)
Solving generic nonarchimedean semidefinite programs using stochastic game algorithms
, 2016 A general issue in computational optimization is to develop combinatorial algorithms for semidefinite programming. We address this issue when the base field is nonarchimedean.
Blekherman G. +5 more
core +6 more sources
Notes on the combinatorial game: graph Nim
Electronic Journal of Graph Theory and Applications, 2016 The combinatorial game of Nim can be played on graphs. Over the years, various Nim-like games on graphs have been proposed and studied by N.J. Calkin et al., L.A. Erickson and M. Fukuyama.
Richard M. Low, W.H. Chan
doaj +1 more source
Using deep neural networks as a guide for modeling human planning
Scientific Reports, 2023 When developing models in cognitive science, researchers typically start with their own intuitions about human behavior in a given task and then build in mechanisms that explain additional aspects of the data.
Ionatan Kuperwajs +2 more
doaj +1 more source
On Aperiodic Subtraction Games with Bounded Nim Sequence [PDF]
, 2014 Subtraction games are a class of impartial combinatorial games whose positions correspond to nonnegative integers and whose moves correspond to subtracting one of a fixed set of numbers from the current position.
Fox, Nathan
core
Leveraging Possibilistic Beliefs in Unrestricted Combinatorial Auctions
Games, 2016 In unrestricted combinatorial auctions, we put forward a mechanism that guarantees a meaningful revenue benchmark based on the possibilistic beliefs that the players have about each other’s valuations.
Jing Chen, Silvio Micali
doaj +1 more source
Scoring Play Combinatorial Games Under Different Operators [PDF]
, 2012 Scoring play games were first studied by Fraser Stewart for his PhD thesis. He showed that under the disjunctive sum, scoring play games are partially ordered, but do not have the same "nice" structure of normal play games.
Stewart, Fraser
core
Complexity of coalition structure generation [PDF]
, 2011 We revisit the coalition structure generation problem in which the goal is to partition the players into exhaustive and disjoint coalitions so as to maximize the social welfare.
Aziz, Haris, de Keijzer, Bart
core +4 more sources
Naming a structured world: a cultural route to duality of patterning.
PLoS ONE, 2012 The lexicons of human languages organize their units at two distinct levels. At a first combinatorial level, meaningless forms (typically referred to as phonemes) are combined into meaningful units (typically referred to as morphemes).
Francesca Tria +2 more
doaj +1 more source
The Variable Hierarchy for the Games mu-Calculus [PDF]
, 2008 Parity games are combinatorial representations of closed Boolean mu-terms. By adding to them draw positions, they have been organized by Arnold and one of the authors into a mu-calculus. As done by Berwanger et al. for the propositional modal mu-calculus,
Belkhir, Walid, Santocanale, Luigi
core +1 more source
Beyond Value Iteration for Parity Games: Strategy Iteration with Universal Trees [PDF]
Logical Methods in Computer ScienceParity games have witnessed several new quasi-polynomial algorithms since the breakthrough result of Calude et al. (STOC 2017). The combinatorial object underlying these approaches is a universal tree, as identified by Czerwiński et al. (SODA 2019).
Zhuan Khye Koh, Georg Loho
doaj +1 more source