Results 1  10
of
1,481,662
On minimal extensions of rings
 Comm. Algebra
"... Given two rings R ⊆ S, S is said to be a minimal ring extension of R if R is a maximal subring of S. In this article, we study minimal extensions of an arbitrary ring R, with particular focus on those possessing nonzero ideals that intersect R trivially. We will also classify the minimal ring extens ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Given two rings R ⊆ S, S is said to be a minimal ring extension of R if R is a maximal subring of S. In this article, we study minimal extensions of an arbitrary ring R, with particular focus on those possessing nonzero ideals that intersect R trivially. We will also classify the minimal ring
Lattices With Large Minimal Extensions
, 1999
"... This paper characterizes those finite lattices which are a maximal sublattice of an infinite lattice. There are 145 minimal lattices with this property, and a finite lattice has an infinite minimal extension if and only if it contains one of these 145 as a sublattice. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper characterizes those finite lattices which are a maximal sublattice of an infinite lattice. There are 145 minimal lattices with this property, and a finite lattice has an infinite minimal extension if and only if it contains one of these 145 as a sublattice.
New Minimal Extension of MSSM
, 1999
"... We construct a new minimal extension of the Minimal Supersymmetric Standard Model (MSSM) by promoting the µparameter to a singlet superfield. The resulting renormalizable superpotential is enforced by a Z5 Rsymmetry which is imposed on the nonrenormalizable operators as well. The proposed model p ..."
Abstract
 Add to MetaCart
We construct a new minimal extension of the Minimal Supersymmetric Standard Model (MSSM) by promoting the µparameter to a singlet superfield. The resulting renormalizable superpotential is enforced by a Z5 Rsymmetry which is imposed on the nonrenormalizable operators as well. The proposed model
MINIMAL EXTENSIONS OF DISTRIBUTIVE BOUNDED LATTICES
"... Dedicated to the memory of Ph. Dwinger Abstract. There is a considerable literature on (proper) maximal sublattices of distributive bounded lattices. In this note, we consider the dual concept of when L ′ is a minimal extension of L, that is L is a (proper) maximal sublattice of L′. Minimal extensi ..."
Abstract
 Add to MetaCart
Dedicated to the memory of Ph. Dwinger Abstract. There is a considerable literature on (proper) maximal sublattices of distributive bounded lattices. In this note, we consider the dual concept of when L ′ is a minimal extension of L, that is L is a (proper) maximal sublattice of L′. Minimal
Forcing minimal extensions of Boolean algebras
 TRANS. AMER. MATH. SOC
, 1999
"... We employ a forcing approach to extending Boolean algebras. A link between some forcings and some cardinal functions on Boolean algebras is found and exploited. We find the following applications: 1) We make Fedorchuk’s method more flexible, obtaining, for every cardinal λ of uncountable cofinalit ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
that the minimal character of a nonprincipal ultrafilter in a homomorphic image of an algebra A can be strictly less than the minimal size of a homomorphic image of A, answering a question of J. D. Monk. 2) We prove that for every cardinal of uncountable cofinality it is consistent that 2 ω = λ and both Aλ and Aω1
Featherweight Java: A Minimal Core Calculus for Java and GJ
 ACM Transactions on Programming Languages and Systems
, 1999
"... Several recent studies have introduced lightweight versions of Java: reduced languages in which complex features like threads and reflection are dropped to enable rigorous arguments about key properties such as type safety. We carry this process a step further, omitting almost all features of the fu ..."
Abstract

Cited by 662 (23 self)
 Add to MetaCart
. The minimal syntax, typing rules, and operational semantics of Featherweight Java make it a handy tool for studying the consequences of extensions and variations. As an illustration of its utility in this regard, we extend Featherweight Java with generic classes in the style of GJ (Bracha, Odersky, Stoutamire
Convergent Treereweighted Message Passing for Energy Minimization
 ACCEPTED TO IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE (PAMI), 2006. ABSTRACTACCEPTED TO IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE (PAMI)
, 2006
"... Algorithms for discrete energy minimization are of fundamental importance in computer vision. In this paper we focus on the recent technique proposed by Wainwright et al. [33] treereweighted maxproduct message passing (TRW). It was inspired by the problem of maximizing a lower bound on the energy ..."
Abstract

Cited by 491 (16 self)
 Add to MetaCart
Algorithms for discrete energy minimization are of fundamental importance in computer vision. In this paper we focus on the recent technique proposed by Wainwright et al. [33] treereweighted maxproduct message passing (TRW). It was inspired by the problem of maximizing a lower bound
The minimal extension of Plocalization on groups
"... Let P be a fixed set of primes, G the category of all groups and grouphomomorphisms, and N the full subcategory of nilpotent groups. In [9], an idempotent functor e: N → N, called Plocalization, was defined so as to extend the Zmoduletheoretic localization of abelian groups. There are two well ..."
Abstract
 Add to MetaCart
Let P be a fixed set of primes, G the category of all groups and grouphomomorphisms, and N the full subcategory of nilpotent groups. In [9], an idempotent functor e: N → N, called Plocalization, was defined so as to extend the Zmoduletheoretic localization of abelian groups. There are two well
PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains
, 2003
"... In recent years research in the planning community has moved increasingly towards application of planners to realistic problems involving both time and many types of resources. For example, interest in planning demonstrated by the space research community has inspired work in observation scheduling, ..."
Abstract

Cited by 601 (41 self)
 Add to MetaCart
In recent years research in the planning community has moved increasingly towards application of planners to realistic problems involving both time and many types of resources. For example, interest in planning demonstrated by the space research community has inspired work in observation scheduling, planetary rover exploration and spacecraft control domains. Other temporal and resourceintensive domains including logistics planning, plant control and manufacturing have also helped to focus the community on the modelling and reasoning issues that must be confronted to make planning technology meet the challenges of application. The international planning competitions have acted as an important motivating force behind the progress that has been made in planning since 1998. The third competition (held in 2002) set the planning community the challenge of handling time and numeric resources. This necessitated the development of a modelling language capable of expressing temporal and numeric properties of planning domains. In this paper we describe the language, PDDL2.1, that was used in the competition. We describe the syntax of the language, its formal semantics and the validation of concurrent plans. We observe that PDDL2.1 has considerable modelling power — exceeding the capabilities of current planning technology — and presents a number of important challenges to the research community.
A Minimal Extension of the WAM for clp(FD)
 Proceedings of the Tenth International Conference on Logic Programming
, 1993
"... We present an abstract instruction set for a constraint solver over finite domains, which can be smoothly integrated in the WAM architecture. It is based on the use of a single primitive constraint X in r which embeds the core propagation mechanism. Complex user constraints such as linear equations ..."
Abstract

Cited by 73 (8 self)
 Add to MetaCart
We present an abstract instruction set for a constraint solver over finite domains, which can be smoothly integrated in the WAM architecture. It is based on the use of a single primitive constraint X in r which embeds the core propagation mechanism. Complex user constraints such as linear equations or inequations are compiled into X in r expressions which encode the propagation scheme chosen to solve the constraint. The uniform treatment of a single primitive constraint leads to a better understanding of the overall constraint solving process and makes possible three main global optimizations which encompass many previous particular optimizations of "black box" finite domains solvers. Implementation results show that this approach combines both simplicity and efficiency. Our clp(FD) system is more than twice as fast as CHIP on average, with peak speedup reaching seven. 1 Introduction Constraint Logic Programming (CLP) has shown to be a very active field of research over recent years, ...
Results 1  10
of
1,481,662