Results 1 - 10
of
168
Labeling and Partial Local Consistency for Soft Constraint Programming
, 2000
"... . In this paper we generalize to soft constraints the approximation techniques usually used for local consistency in classical constraint satisfaction and programming. The theoretical results show that this is indeed possible without loosing the fundamental properties of such techniques, and the exp ..."
Abstract
-
Cited by 12 (5 self)
- Add to MetaCart
, and the experimental results (on partial arc-consistency) show that this work can help develop more efficient implementations for logic-based languages working with soft constraints. 1 Introduction In [4--6, 11, 12], a new constraint solving framework (called SCSP) has been defined and implemented where classical
Approximation of Local Consistency for Soft Constraints
"... In this paper we generalize to soft constraints the techniques and approximations usually used for local consistency in classical constraint satisfaction and programming. The theoretical results show that this is indeed possible without loosing the fundamental properties of such techniques, and the ..."
Abstract
- Add to MetaCart
, and the experimental results (on partial arc-consistency) show that this work can help develop more ecient implementations for logic-based languages working with soft constraints. 1 Introduction In [4, 6, 5, 9, 10], a new framework (called SCSP) has been dened and implemented where classical CSPs, fuzzy CSPs
Whom You Know Matters: Venture Capital Networks and Investment Performance,
- Journal of Finance
, 2007
"... Abstract Many financial markets are characterized by strong relationships and networks, rather than arm's-length, spot-market transactions. We examine the performance consequences of this organizational choice in the context of relationships established when VCs syndicate portfolio company inv ..."
Abstract
-
Cited by 138 (8 self)
- Add to MetaCart
to examine the performance consequences of the VC industry's predominant choice of organizational form: Networks. Previous work has focused on describing the structure of syndication networks (Bygrave (1987(Bygrave ( , 1988, The remainder of the paper is organized as follows. Section I provides
Soft Constraints Processing over Divisible Residuated Lattices
"... Abstract. We claim that divisible residuated lattices (DRLs) can act as a unifying evaluation framework for soft constraint satisfaction prob-lems (soft CSPs). DRLs form the algebraic semantics of a large family of substructural and fuzzy logics [13, 15], and are therefore natural can-didates for th ..."
Abstract
- Add to MetaCart
Abstract. We claim that divisible residuated lattices (DRLs) can act as a unifying evaluation framework for soft constraint satisfaction prob-lems (soft CSPs). DRLs form the algebraic semantics of a large family of substructural and fuzzy logics [13, 15], and are therefore natural can
Taming intractable branching in qualitative simulation
- Proceedings of the Tenth International Joint Conference on Artificial Intelligence (IJCAI-87). Los
, 1987
"... Qualitative simulation of behavior from structure is a valuable method for reasoning about partially known physical systems. Unfortunately, in many realistic situations, a qualitative description of structure is consistent with an intractibly large number of behavioral predictions. We present two co ..."
Abstract
-
Cited by 33 (8 self)
- Add to MetaCart
Qualitative simulation of behavior from structure is a valuable method for reasoning about partially known physical systems. Unfortunately, in many realistic situations, a qualitative description of structure is consistent with an intractibly large number of behavioral predictions. We present two
k-hyperarc consistency for soft constraints over divisible residuated lattices
- Ann. Inst. Fourier (Grenoble
, 1983
"... We investigate the applicability of divisible residuated lattices (DRLs) as a general evaluation framework for soft constraint satisfaction problems (soft CSPs). DRLs are in fact natural candidates for this role, since they form the algebraic semantics of a large family of substructural and fuzzy lo ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
logics [GJKO07, Háj98]. We present the following results. (i) We show that DRLs subsume important valuation structures for soft constraints, such as commutative idempotent semirings [BMR97] and fair valuation structures [CS04], in the sense that the last two are members of certain subvarieties of DRLs
Notes for the ECAI2000 tutorial on Solving and Programming with Soft Constraints: Theory and Practice
, 2000
"... Soft constraints add to the classical notion of constraint the possibility of dealing with important features like fuzziness, uncertainty, optimization, probability, and partial satisfaction. This tutorial will describe the current state-of-the-art in the area of soft constraints, by reviewing the e ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
Soft constraints add to the classical notion of constraint the possibility of dealing with important features like fuzziness, uncertainty, optimization, probability, and partial satisfaction. This tutorial will describe the current state-of-the-art in the area of soft constraints, by reviewing
Directed Soft Arc Consistency in Pseudo Trees
"... We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent systems. With DCOPs a multi-agent system is represented as a set of variables and a set of constraints/cost functions. We ..."
Abstract
-
Cited by 8 (2 self)
- Add to MetaCart
focus on DCOP solvers that employ pseudo-trees. A pseudo-tree is a graph structure for a constraint network that represents a partial ordering of variables. Most pseudo-tree-based search algorithms perform optimistic searches using explicit/implicit backtracking in parallel. However, for cost functions
Representing Partial Spatial Information in Databases
- Proceedings Fifteenth International Conference on Conceptual Modeling (ER’96
, 1996
"... . In this paper we present a spatial data model which facilitates the representation of and reasoning with various forms of qualitatively and quantitatively incomplete spatial information. The model is founded on a combination of object-oriented and constraint-based data modeling facilities and prov ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
. In this paper we present a spatial data model which facilitates the representation of and reasoning with various forms of qualitatively and quantitatively incomplete spatial information. The model is founded on a combination of object-oriented and constraint-based data modeling facilities
Positive and Negative Feedback: Striking a balance between necessary antagonists
- J. Theor. Biol
, 2002
"... Most biological regulation systems comprise feedback circuits as crucial components. Negative iedback circuits have been well understood for a very long time; indeed, their understanding has been the basis for the engineering of cybernetic machines exhibiting stable behaviour. The importance of posi ..."
Abstract
-
Cited by 61 (10 self)
- Add to MetaCart
' autonomous differential systems, covering a wide class of biologically relevant systems, to possess multiple steady states. We also show ways to derive constraints on the weights of positive and negative feedback circuits. These qualitative and quantitative restilts provide respectively structural
Results 1 - 10
of
168