Filters








2,087,619 Hits in 5.1 sec

The Ordered Distribute Constraint

Thierry Petit, Jean-Charles Regin
2010 2010 22nd IEEE International Conference on Tools with Artificial Intelligence  
In this paper we introduce a new cardinality constraint: Ordered Distribute.  ...  We design an algorithm for achieving generalized arc-consistency on Ordered Distribute, with a time complexity linear in the sum of the number of variables and the number of values in the union of their  ...  Aggregations of OrderedDistribute The main usage of OrderedDistribute is depicted by Example 3.1 and Figure 2 : In order to obtain a particular distribution of costs, cost variables are partitioned and  ... 
doi:10.1109/ictai.2010.68 dblp:conf/ictai/PetitR10 fatcat:fpjz4fyg4fgplgulr3qezn5vim

THE ORDERED DISTRIBUTE CONSTRAINT

THIERRY PETIT, JEAN-CHARLES RÉGIN
2011 International journal on artificial intelligence tools  
In this paper we introduce a new cardinality constraint: Ordered Distribute.  ...  We design an algorithm for achieving generalized arc-consistency on Ordered Distribute, with a time complexity linear in the sum of the number of variables and the number of values in the union of their  ...  Aggregations of OrderedDistribute The main usage of OrderedDistribute is depicted by Example 3.1 and Figure 2 : In order to obtain a particular distribution of costs, cost variables are partitioned and  ... 
doi:10.1142/s0218213011000371 fatcat:m542nvw5jfdi3nkgxukawoycpm

Constraints on two-particle distribution function due to permutational symmetry of higher-order distribution functions

Andrey Pereverzev
2006 Physical Review B  
We investigate how the range of parameters that specify the two-particle distribution function is restricted if we require that this function be obtained from the n^ th order distribution functions that  ...  We consider the simple case when each variable in the distribution functions can take only two values. Results for all n values are given, including the limit of n→∞.  ...  Acknowledgments The author would like to thank Eric. R. Bittner for useful discussions. This work was funded in part through grants from the National Science Foundation and the Robert A.  ... 
doi:10.1103/physrevb.73.174411 fatcat:ec6a4n6hhjdcjjukyngwqgk3dm

The general behavior of NLO unintegrated parton distributions based on the single-scale evolution and the angular ordering constraint

H. Hosseinkhani, M. Modarres
2011 Physics Letters B  
parton distribution functions (UPDF), Kimber, Martin and Ryskin (KMR) proposed a procedure based on (i) the inclusion of single-scale (μ) only at the last step of evolution and (ii) the angular ordering  ...  constraint (AOC) on the DGLAP terms (the DGLAP collinear approximation), to bring the second scale, k_t into the UPDF evolution equations.  ...  Acknowledgements We would like to acknowledge the Research Council of University of Tehran and Institute for Research and Planning in Higher Education for the grants provided for us.  ... 
doi:10.1016/j.physletb.2010.10.007 fatcat:2er4fo7skrhvjjdngxcnuxtspm

A decentralized variable ordering method for distributed constraint optimization

Anton Chechetka, Katia Sycara
2005 Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems - AAMAS '05  
the data needed, and completing and reviewing the collection of information.  ...  Public reporting burden for the collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining  ...  Proof: The proof by contradiction is similar to the acyclic case. Suppose AgentDepth(x 1 , X) = AgentDepth(x n , X) = depth(X), and x 1 and x n are not neighbors and do not belong to the same block.  ... 
doi:10.1145/1082473.1082746 dblp:conf/atal/ChechetkaS05 fatcat:ocxcdjputna45izvoaofflb3la

Semantics for probabilistic programming

Sam Staton, Hongseok Yang, Frank Wood, Chris Heunen, Ohad Kammar
2016 Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '16  
We study the semantic foundation of expressive probabilistic programming languages, that support higher-order functions, continuous distributions, and soft constraints (such as Anglican, Church, and Venture  ...  The language enables defining probability distributions on higher-order functions, and we study their properties.  ...  We consider the more expressive languages, that support higher-order functions, continuous distributions, and soft constraints.  ... 
doi:10.1145/2933575.2935313 dblp:conf/lics/StatonYWHK16 fatcat:ggvgmheyang6ffdofh3civco2a

Firehose constraints of the bi-Kappa-distributed electrons: a zero-order approach for the suprathermal electrons in the solar wind

M. Lazar, S. M. Shaaban, S. Poedts, Š. Štverák
2016 Monthly notices of the Royal Astronomical Society  
either the entire distribution or only the suprathermal halo tails.  ...  In a zero-order limiting approach of the halo component (minimizing the effects of a cooler and less anisotropic core population) the instability thresholds align to the limits of the temperature anisotropy  ...  ACKNOWLEDGMENTS The authors acknowledge support from the Katholieke Universiteit Leuven, Ruhr-University Bochum, and Alexander von Humboldt Foundation.  ... 
doi:10.1093/mnras/stw2336 fatcat:z24g3ql265a33brhnru4r4ac4m

Choosing Diameters for the Elements of Single Output Flow Distribution Systems with Constraints on the Order of Their Sizes
Выбор диаметров для элементов систем потокораспределения с одним входом при ограничениях на порядок следования их типоразмеров

S.D. VYNNYCHUK, Pukhov Institute for Problems in Electrical Engineering, V.Ya. KONDRASHCHENKO, Pukhov Institute for Problems in Electrical Engineering
2017 Èlektronnoe modelirovanie  
Kondrashchenko CHOOSING DIAMETERS FOR THE ELEMENTS OF SINGLE OUTPUT FLOW DISTRIBUTION SYSTEMS WITH CONSTRAINTS ON THE ORDER OF THEIR SIZES The problem of minimizing the weight of the hydraulic distribution  ...  system with following constraints: the system graph is the directed rooted tree, element diameters of the branches that are downstream the compressible fluid, may not exceed the diameter of the cells  ... 
doi:10.15407/emodel.39.02.059 fatcat:3ilauboi5bhedopvb4qkzbmgee

Routability Crossing Distribution and Floating Pin Assignment for T-type Junction Region

Jin-Tai Yan
1999 VLSI design (Print)  
For routability quota crossing distribution in one T-type junction region, if the number of net crossings in base channel is more than a given quota, this net ordering in routability crossing distribution  ...  For routability crossing distribution in one T-type junction region, a routability-ordering graph is built to decide a net ordering in O(n2) time.  ...  Any constraint-ordering graph G* is Since any constraint-ordering graph is acyclic, a net ordering for a constraint-ordering graph will be obtained by using a topological sorting.  ... 
doi:10.1155/1999/12841 fatcat:nypzb5rnafat3ib7wex2345k5i

Dynamic Agent Ordering in Distributed Constraint Satisfaction Problems [chapter]

Lingzhong Zhou, John Thornton, Abdul Sattar
2003 Lecture Notes in Computer Science  
The distributed constraint satisfaction problem (CSP) is a general formalisation used to represent problems in distributed multiagent systems.  ...  To this end we present a new algorithm using unsatised constraint densities to dynamically determine agent ordering during the search.  ...  We have demonstrated a new algorithm that uses constraint density to dynamically order agents and increase the search speed in distributed CSPs.  ... 
doi:10.1007/978-3-540-24581-0_36 fatcat:ry3er5tuzbc5piwvzcravbmv6i

Integrating multi-agent negotiation to resolve constraints in fulfilling supply chain orders

Fu-ren Lin, You-yu Lin
2006 Electronic Commerce Research and Applications  
The results show that the integrated system outperforms the existing distributed constraint satisfaction algorithms in various demand patterns.  ...  The coordination of OFP among supply chain partners can be viewed as a distributed constraint satisfaction problem (DCSP).  ...  Acknowledgment The authors are grateful to the following sponsors in this research: the Ministry of Education (Program for Promoting Academic Excellent of Universities under the grant number A-91-H-FA08  ... 
doi:10.1016/j.elerap.2006.04.003 fatcat:eprd5zpqfbfxrk6ce2h4dwpdzi

Formal Concept Analysis with Many-sorted Attributes [article]

Robert E. Kent, John Brady
2018 arXiv   pre-print
This paper advocates distributed relations as a more semantic version of networks of constraints.  ...  The theory developed here uses the theory of formal concept analysis, pioneered by Rudolf Wille and his colleagues, as a key for unlocking the hidden semantic structure within distributed relations.  ...  However, the more general satisfaction relationships between object tuples and constraints that we define in this section associate an order-theoretic formal context with each distributed relation R =  ... 
arXiv:1810.05703v1 fatcat:ehbr37w3nbb3tgf7g6pq7arpum

Asynchronous weak-commitment search for solving distributed constraint satisfaction problems [chapter]

Makoto Yokoo
1995 Lecture Notes in Computer Science  
A distributed constraint satisfaction problem (Distributed CSP) is a CSP in which variables and constraints are distributed among multiple automated agents, and various application problems in Distributed  ...  The experimental results on various example problems show that this algorithm is by far more efficient than the asynchronous backtracking algorithm for solving Distributed CSPs, in which the priority order  ...  Acknowledgments The author wish to thank N. Fujii and I. Yoda for providing the network configuration management database, and Y. Nishibe for providing the example problems.  ... 
doi:10.1007/3-540-60299-2_6 fatcat:7u73yn2v5zeivorw3khcifp6la

An Integrated Bayesian Nonparametric Approach for Stochastic and Variability Orders in ROC Curve Estimation: An Application to Endometriosis Diagnosis

Beom Seuk Hwang, Zhen Chen
2015 Journal of the American Statistical Association  
To demonstrate the performance of the methodology, we conducted simulation studies with varying sample sizes, distributional assumptions and order constraints.  ...  The stochastic order constrains the distributional centers of the diseased and healthy populations within a test, while the variability order constrains the distributional spreads of the tests within each  ...  This study utilized the high-performance computational capabilities of the Biowulf Linux cluster at the National Institutes of Health, Bethesda, MD (http:// biowulf.nih.gov).  ... 
doi:10.1080/01621459.2015.1023806 pmid:26839441 pmcid:PMC4733471 fatcat:724lax7q7ff3dp7b3hcv23zgcm

The distributed constraint satisfaction problem: formalization and algorithms

M. Yokoo, E.H. Durfee, T. Ishida, K. Kuwabara
1998 IEEE Transactions on Knowledge and Data Engineering  
exhaustive search by changing the priority order of agents dynamically.  ...  A distributed CSP is a constraint satisfaction problem in which variables and constraints are distributed among multiple agents.  ...  Distributed CSP A distributed CSP is a CSP in which the variables and constraints are distributed among automated agents.  ... 
doi:10.1109/69.729707 fatcat:pskqhoda5fbj7morc27thnlv6q
« Previous Showing results 1 — 15 out of 2,087,619 results