Bordered conjugates of words over large alphabets.
Bottom-up learning of hierarchical models in a class of deterministic POMDP environments
The theory of partially observable Markov decision processes (POMDPs) is a useful tool for developing various intelligent agents, and learning hierarchical POMDP models is one of the key approaches for building such agents when the environments of the agents are unknown and large. To learn hierarchical models, bottom-up learning methods in which learning takes place in a layer-by-layer manner from the lowest to the highest layer are already extensively used in some research fields such as hidden...
Boundaries in digital planes.
Boundary of the union of rectangles in the plane
Given rectangles in a plane whose all sides belong to two perpendicular directions, an algorithm for the construction of the boundary of the union of those rectangles is shown in teh paper.
Bounded queries to arbitrary sets
Boundedness of oriented walks generated by substitutions
Let be a fixed point of a substitution on the alphabet and let and . We give a complete classification of the substitutions according to whether the sequence of matrices is bounded or unbounded. This corresponds to the boundedness or unboundedness of the oriented walks generated by the substitutions.
Boundedness on stochastic Petri nets.
Stochastic Petri nets generalize the notion of queuing systems and are a useful model in performance evaluation of parallel and distributed systems. We give necessary and sufficient conditions for the boundedness of a stochastic process related to these nets.
Bounds for on-line selection
Bounds for orthogonal 3-D graph drawing.
Bounds for the degrees in the membership test for a polynomial ideal
Bounds for the discrete correlation of infinite sequences on k symbols and generalized Rudin-Shapiro sequences
Bounds of graph parameters for global constraints
This article presents a basic scheme for deriving systematically a filtering algorithm from the graph properties based representation of global constraints. This scheme is based on the bounds of the graph parameters used in the description of a global constraint. The article provides bounds for the most common used graph parameters.
Bounds of graph parameters for global constraints
This article presents a basic scheme for deriving systematically a filtering algorithm from the graph properties based representation of global constraints. This scheme is based on the bounds of the graph parameters used in the description of a global constraint. The article provides bounds for the most common used graph parameters.
Bounds on degrees of projective schemes.
Bounds on the Size of Tetrahedralizations.
Bounds on the throughput of an unslotted ALOHA channel in the case of a heterogeneous users' population
Bouquets of circles for lamination languages and complexities
Laminations are classic sets of disjoint and non-self-crossing curves on surfaces. Lamination languages are languages of two-way infinite words which code laminations by using associated labeled embedded graphs, and which are subshifts. Here, we characterize the possible exact affine factor complexities of these languages through bouquets of circles, i.e. graphs made of one vertex, as representative coding graphs. We also show how to build families of laminations together with corresponding lamination...
Brain-like functor control machine for general humanoid biodynamics.
Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions
This paper deals with the parallel-machine scheduling problem with the aim of minimizing the total (weighted) tardiness under the assumption of different release dates. This problem has been proven to be NP-hard. We introduce some new lower and upper bounds based on different approaches. We propose a branch-and-bound algorithm to solve the weighted and unweighted total tardiness. Computational experiments were performed on a large set of instances...
Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions
This paper deals with the parallel-machine scheduling problem with the aim of minimizing the total (weighted) tardiness under the assumption of different release dates. This problem has been proven to be NP-hard. We introduce some new lower and upper bounds based on different approaches. We propose a branch-and-bound algorithm to solve the weighted and unweighted total tardiness. Computational experiments were performed on a large set of instances...