The paper reports on new algorithms for solving partially observable games. Whereas existing algorithms apply AND-OR search to a tree of blackbox belief states, our “incremental” versions treat uncertainty as a new search dimension, examining the physical states within a belief state to construct solution trees incrementally. On a newly created database of checkmate problems for Kriegspiel (a p...

a common fixed point result for weakly increasing mappings satisfying generalized contractive type of zhang in ordered metric spaces are derived.

A bstract We study the manifestly covariant and local 1-loop path integrals on S d +1 for general massive, shift-symmetric (partially) massless totally symmetric tensor fields of arbitrary spin s ≥ 0 in any dimensions 2. After reviewing cases with = 1 , 2, we provide a detailed derivation integer spins 1. Following standard procedure Wick-rotating negative conformal modes, find higher analog Po...

In this paper we study the extremal type problem arising from the question: What is the maximum number ET (S) of edges that a geometric graph G on a planar point set S can have such that it does not contain empty triangles? We prove: ( n 2 ) −O(n log n) ≤ ET (n) ≤ ( n 2 ) − ( n− 2 + ⌊n 8 ⌋) . keywords: Geometric graphs Empty triangles Combinatorial Geometry Extremal Problem ∗Partially supported...

Two partially ordered monoids S and T are called Morita equivalent if the categories of right S-posets and right T -posets are Pos-equivalent as categories enriched over the category Pos of posets. We give a description of Pos-prodense biposets and prove Morita theorems I, II, and III for partially ordered monoids.