Results 21  30
of
1,366
Excluding Symmetries in ConstraintBased Search
, 1999
"... . We introduce a new method for excluding symmetries in constraint based search. To our knowledge, it is the rst declarative method that can be applied to arbitrary symmetries. Our method is based on the notion of symmetric constraints, which are used in our modication of a general constraint ba ..."
Abstract

Cited by 91 (5 self)
 Add to MetaCart
. We introduce a new method for excluding symmetries in constraint based search. To our knowledge, it is the rst declarative method that can be applied to arbitrary symmetries. Our method is based on the notion of symmetric constraints, which are used in our modication of a general constraint
Error Analysis and Estimation for Finite Volume Method with Applications to Fluid Flow
, 1996
"... The accuracy of numerical simulation algorithms is one of main concerns in modern Computational Fluid Dynamics. Development of new and more accurate mathematical models requires an insight into the problem of numerical errors. In order to construct an estimate of the solution error in Finite Volume ..."
Abstract

Cited by 83 (11 self)
 Add to MetaCart
Volume calculations, it is ¯rst necessary to examine its sources. Discretisation errors can be divided into two groups: errors caused by the discretisation of the solution domain and equation discretisation errors. The ¯rst group includes insu±cient mesh resolution, mesh skewness and non
Asymptotic solution of the turbulent
"... The equations describing the rst two terms of an asymptotic expansion of the solution of the planar turbulent mixing layer for values of the velocity ratio close to one are obtained. The rst term of this expansion is the solution of the wellknown timeevolving problem and the second, which includes ..."
Abstract
 Add to MetaCart
The equations describing the rst two terms of an asymptotic expansion of the solution of the planar turbulent mixing layer for values of the velocity ratio close to one are obtained. The rst term of this expansion is the solution of the wellknown timeevolving problem and the second, which includes
ResourceConstrained Project Scheduling: From a Lagrangian Relaxation to Competitive Solutions
, 2000
"... List scheduling belongs to the classical and widely used algorithms for scheduling problems, but for resourceconstrained project scheduling problems most standard priority lists do not capture enough of the problem structure, often resulting in poor performance. We use a wellknown Lagrangian relax ..."
Abstract

Cited by 42 (3 self)
 Add to MetaCart
relaxation to rst compute schedules which do not necessarily respect the resource constraints. We then apply list scheduling in the order of socalled completion times of jobs. Embedded into a standard subgradient optimization, our computational results show that the schedules compare to those obtained
Families Of Periodic Solutions Of Resonant PDEs
 J. Nonlinear Sci
, 2001
"... . We study small oscillations of a semilinear partial dierential equation about a completely resonant equilibrium point. We use averaging methods to construct a suitable functional in the unit ball of the conguration space. We prove that to each nondegenerate critical point of such a functional ther ..."
Abstract

Cited by 23 (1 self)
 Add to MetaCart
there corresponds a family of small amplitude periodic orbits of the system. The proof is based on Lyapunov{Schmidt decomposition. Our technique establishes a rst direct relation between averaging techniques and Lyapunov{Schmidt decomposition. An application to the construction of small oscillations
Relational InstanceBased Learning
 Proceedings of the Thirteenth International Conference on Machine Learning
, 1996
"... A relational instancebased learning algorithm, called Ribl, is motivated and developed in this paper. We argue that instancebased methods o#er solutions to the often unsatisfactory behavior of current inductive logic programming #ILP# approaches in domains with continuous attribute values a ..."
Abstract

Cited by 79 (1 self)
 Add to MetaCart
A relational instancebased learning algorithm, called Ribl, is motivated and developed in this paper. We argue that instancebased methods o#er solutions to the often unsatisfactory behavior of current inductive logic programming #ILP# approaches in domains with continuous attribute values
FUZZY SOLUTIONS FOR IMPULSIVE DIFFERENTIAL EQUATIONS
"... ABSTRACT. In this paper, a xed point theorem for absolute retract is used to investigate the existence of fuzzy solutions for rst and second order impulsive ordinary dierential equations. AMS (MOS) Subject Classication. 34A37. 1. ..."
Abstract
 Add to MetaCart
ABSTRACT. In this paper, a xed point theorem for absolute retract is used to investigate the existence of fuzzy solutions for rst and second order impulsive ordinary dierential equations. AMS (MOS) Subject Classication. 34A37. 1.
Transseries Solutions of Algebraic Differential Equations
, 2002
"... Transseries are series de ned using exponential and logarithmic variables. They were rst introduced to describe very general types of strongly monotonic asymptotic behaviour. The functions that are considered do not present any oscillatory phenomenon. An algorithm is presented that computes tra ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Transseries are series de ned using exponential and logarithmic variables. They were rst introduced to describe very general types of strongly monotonic asymptotic behaviour. The functions that are considered do not present any oscillatory phenomenon. An algorithm is presented that computes
On billiard solutions of nonlinear PDEs
 Phys. Lett. A
, 1999
"... This letter presents some special features of a class of integrable PDE’s admitting billiardtype solutions, which set them apart from equations whose solutions are smooth, such as the KdV equation. These billiard solutions are weak solutions that are piecewise smooth and have rst derivative discont ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This letter presents some special features of a class of integrable PDE’s admitting billiardtype solutions, which set them apart from equations whose solutions are smooth, such as the KdV equation. These billiard solutions are weak solutions that are piecewise smooth and have rst derivative
New filtering for the cumulative constraint in the context of nonoverlapping
 In CPAIOR 08
, 2008
"... Abstract. This paper describes new ltering methods for the cumulative constraint. The rst method introduces bounds for the so called longest cumulative hole problem and shows how to use these bounds in the context of the nonoverlapping constraint. The second method introduces balancing knapsack c ..."
Abstract

Cited by 19 (1 self)
 Add to MetaCart
solutions as well as for nding the rst solution. For example, we found without backtracking all solutions to 66 perfect square instances of order 2325 and sizes ranging from 332 332 to 661 661. 1
Results 21  30
of
1,366