Results 1  10
of
18,906
Where the REALLY Hard Problems Are
 IN J. MYLOPOULOS AND R. REITER (EDS.), PROCEEDINGS OF 12TH INTERNATIONAL JOINT CONFERENCE ON AI (IJCAI91),VOLUME 1
, 1991
"... It is well known that for many NPcomplete problems, such as KSat, etc., typical cases are easy to solve; so that computationally hard cases must be rare (assuming P != NP). This paper shows that NPcomplete problems can be summarized by at least one "order parameter", and that the hard p ..."
Abstract

Cited by 683 (1 self)
 Add to MetaCart
of a solution changes abruptly from near 0 to near 1. It is the high density of wellseparated almost solutions (local minima) at this boundary that cause search algorithms to "thrash". This boundary is a type of phase transition and we show that it is preserved under mappings between
Ecology of the family as a context for human development: Research perspectives.
 Developmental Psychology,
, 1986
"... This review collates and examines critically a theoretically convergent but widely dispersed body of research on the influence of external environments on the functioning of families as contexts of human development. Investigations falling within this expanding domain include studies of the interac ..."
Abstract

Cited by 518 (0 self)
 Add to MetaCart
of the interaction of genetics and environment in family processes; transitions and linkages between the family and other major settings influencing development, such as hospitals, day care, peer groups, school, social networks, the world of work (both for parents and children), and neighborhoods and communities
Verbs and Adverbs: Multidimensional Motion Interpolation Using Radial Basis Functions
 IEEE Computer Graphics and Applications
, 1998
"... This paper describes methods and data structures used to leverage motion sequences of complex linked figures. We present a technique for interpolating between example motions derived from live motion capture or produced through traditional animation tools. These motions can be characterized by emoti ..."
Abstract

Cited by 351 (5 self)
 Add to MetaCart
in order to avoid, for example, the feet slipping on the floor during a support phase of a walk cycle. Once the verbs and...
Abstract interpretation and application to logic programs
, 1992
"... Abstract interpretation is a theory of semantics approximation which is usedfor the construction of semanticsbasedprogram analysis algorithms (sometimes called“data flow analysis”), the comparison of formal semantics (e.g., construction of a denotational semantics from an operational one), the des ..."
Abstract

Cited by 317 (14 self)
 Add to MetaCart
standardoperational semantics formalizedas a transition system, classes of program properties are first encapsulatedin collecting semantics expressedas fixpoints on partial orders representing concrete program properties. We consider invariance properties characterizing the descendant states of the initial states
LowTemperature Series for Renormalized Operators: the Ferromagnetic SquareLattice Ising Model
 J. Stat. Phys
, 1995
"... A method for computing lowtemperature series for renormalized operators in the twodimensional Ising model is proposed. Series for the renormalized magnetization and nearestneighbor correlation function are given for the majority rule transformation on 2 \Theta 2 blocks and random tiebreaker. ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
breaker. These series are applied to the study at very low temperature of the firstorder phase transition undergone by this model. We analyze how truncation in the renormalized Hamiltonian leads to spurious discontinuities of the Renormalization Group transformation. Keywords: Renormalization group, position
Nondeterministic Space is Closed Under Complementation
, 1988
"... this paper we show that nondeterministic space s(n) is closed under complementation, for s(n) greater than or equal to log n. It immediately follows that the contextsensitive languages are closed under complementation, thus settling a question raised by Kuroda in 1964 [9]. See Hartmanis and Hunt [4 ..."
Abstract

Cited by 262 (14 self)
 Add to MetaCart
complementation [6]. This holds with or without an ordering relation on the structure. If an ordering is present the resulting class is P. Many people expected that the result was false in the absence of an ordering. In 1983 we studied firstorder logic, with ordering, with a transitive closure operator. We
FIRSTORDER PHASE TRANSITIONS
"... Abstract. The lecture starts with an overview of some of the most important properties of firstorder phase transitions and their distinctive features compared with secondorder transitions. Then special emphasis will be placed on the finitesize scaling behaviour of firstorder phase transitions, w ..."
Abstract
 Add to MetaCart
Abstract. The lecture starts with an overview of some of the most important properties of firstorder phase transitions and their distinctive features compared with secondorder transitions. Then special emphasis will be placed on the finitesize scaling behaviour of firstorder phase transitions
No FirstOrder Phase Transition in the
, 2001
"... Within a variational calculation we investigate the role of baryons for the structure of dense matter in the GrossNeveu model. We construct a trial ground state at finite baryon density which breaks translational invariance. Its scalar potential interpolates between widely spaced kinks and antikink ..."
Abstract
 Add to MetaCart
and antikinks at low density and the value zero at infinite density. Its energy is lower than the one of the standard Fermi gas at all densities considered. This suggests that the discrete γ5 symmetry of the GrossNeveu model does not get restored in a first order phase transition at finite density, at variance
Languages That Capture Complexity Classes
 SIAM Journal of Computing
, 1987
"... this paper a series of languages adequate for expressing exactly those properties checkable in a series of computational complexity classes. For example, we show that a property of graphs (respectively groups, binary strings, etc.) is in polynomial time if and only if it is expressible in the first ..."
Abstract

Cited by 245 (21 self)
 Add to MetaCart
order language of graphs (respectively groups, binary strings, etc.) together with a least fixed point operator. As another example, a property is in logspace if and only if it is expressible in first order logic together with a deterministic transitive closure operator. The roots of our approach
The induction of dynamical recognizers
 Machine Learning
, 1991
"... A higher order recurrent neural network architecture learns to recognize and generate languages after being "trained " on categorized exemplars. Studying these networks from the perspective of dynamical systems yields two interesting discoveries: First, a longitudinal examination of the le ..."
Abstract

Cited by 225 (14 self)
 Add to MetaCart
A higher order recurrent neural network architecture learns to recognize and generate languages after being "trained " on categorized exemplars. Studying these networks from the perspective of dynamical systems yields two interesting discoveries: First, a longitudinal examination
Results 1  10
of
18,906