Filters








4,958 Hits in 9.8 sec

Exact and Approximation Algorithms for the Maximum Constraint Satisfaction Problem over the Point Algebra

Yoichi Iwata, Yuichi Yoshida, Marc Herbstritt
2013 Symposium on Theoretical Aspects of Computer Science  
We study the constraint satisfaction problem over the point algebra.  ...  As for approximation, we give a 0.4586-approximation algorithm when the objective is maximizing the number of satisfied constraints, and give an O(log n log log n)-approximation algorithm when the objective  ...  Acknowledgments The authors are grateful to François Le Gall for valuable discussions about the usage of sparse matrix product for the exact algorithm.  ... 
doi:10.4230/lipics.stacs.2013.127 dblp:conf/stacs/IwataY13 fatcat:ssd4orheqfcxhhusa5usp5xi3i

Numerical Algorithms for Estimating Probability Density Function Based on the Maximum Entropy Principle and Fup Basis Functions

Nives Brajčić Kurbaša, Blaž Gotovac, Vedrana Kozulić, Hrvoje Gotovac
2021 Entropy  
Despite many numerical improvements over the past two decades, the classical moment problem of maximum entropy (MaxEnt) is still a very demanding numerical and statistical task.  ...  Algorithm 2 is very efficient for larger numbers of moments and especially for skewed pdfs.  ...  Fund-the Competitiveness and Cohesion Operational Programme.  ... 
doi:10.3390/e23121559 pmid:34945865 pmcid:PMC8699978 fatcat:rcgdyyhp7zcgnoon6kvsd6bjsm

Convergence Properties of the Softassign Quadratic Assignment Algorithm

Anand Rangarajan, Alan Yuille, Eric Mjolsness
1999 Neural Computation  
Here, we construct discrete time Lyapunov functions for the cases of exact and approximate doubly stochastic constraint satisfaction which can be used to show convergence to a fixed point.  ...  In contrast, in Section 3.2 we show that for the case of approximate doubly stochastic constraint satisfaction, a discrete time Lyapunov function can be easily constructed only for the exponential neuronal  ...  In this section, we bypass these potential problems by assuming exact constraint satisfaction-of positivity and the row and column constraints.  ... 
doi:10.1162/089976699300016313 pmid:10423503 fatcat:yb3eeqlou5h7tn6635jswkji64

Local optimization of dynamic programs with guaranteed satisfaction of path constraints

Jun Fu, Johannes M.M. Faust, Benoît Chachuat, Alexander Mitsos
2015 Automatica  
The algorithm is based on iteratively approximating the PCDP by restricting the right-hand side of the path constraints and enforcing the path constraints at finitely many time points.  ...  The main assumptions are: i) availability of a nonlinear program (NLP) local solver that generates a KKT point of the constructed approximation to PCDP at each iteration if this problem is indeed feasible  ...  We start by verifying the property of guaranteed satisfaction of path constraints of Algorithm 1 for both problems.  ... 
doi:10.1016/j.automatica.2015.09.013 fatcat:26wp6zikybeydpfww5o7hfrgfm

High order optimal control of space trajectories with uncertain boundary conditions

P. Di Lizia, R. Armellin, F. Bernelli-Zazzera, M. Berz
2014 Acta Astronautica  
Since the optimal control problem can be reduced to a two-point boundary value problem, differential algebra is used to compute the high order expansion of the solution of the optimal control problem about  ...  The resulting polynomials can be manipulated to obtain the high order expansion of the solution of two-point boundary value problems.  ...  so-called truncated power series algebra [13] . a, b ∈ R a, b ∈ F P a × b × ⊗ a ⊗ b T T f, g f × g × ⊗ T T F, G F ⊗ G Similarly to the algorithms for floating point arithmetic, the algorithm for functions  ... 
doi:10.1016/j.actaastro.2013.07.007 fatcat:v7aizt4i65anxdksljofkgjm5i

Frontmatter, Table of Contents, Preface, Workshop Organization

Natacha Portier, Thomas Wilke, Marc Herbstritt
2013 Symposium on Theoretical Aspects of Computer Science  
Special thanks go to Andrei Voronkov for providing EasyChair, the software used for processing and screening submissions to the conference.  ...  We would like to warmly thank Henning Schnoor and Björn Kinscher for preparing these conference proceedings, and Michael Wagner and Marc Herbstritt from the Dagstuhl/LIPIcs team for assisting us in the  ...  Schweller, Session 4A: Graph Algorithms and Theory Exact and Approximation Algorithms for the Maximum Constraint Satisfaction Problem over the Point Algebra Yoichi Iwata and Yuichi Yoshida . . . . . .  ... 
doi:10.4230/lipics.stacs.2013.i dblp:conf/stacs/PortierW13 fatcat:7vrdra3ocrcidkpcyfoxjgm7em

Page 5744 of Mathematical Reviews Vol. , Issue 97I [page]

1997 Mathematical Reviews  
—404); Hoong Chuin Lau and Osamu Watanabe [Osamu Watanabe’], Randomized approximations of the constraint satisfaction prob- lem (405—424).  ...  Eppstein, Using spar- sification for parametric minimum spanning tree problems (352- 366); Takao Asano, Takao Ono and Tomio Hirata, Approxima- tion algorithms for the maximum satisfiability problem (388  ... 

Probabilistic Inference with Algebraic Constraints: Theoretical Limits and Practical Approximations

Zhe Zeng, Paolo Morettin, Fanqi Yan, Antonio Vergari, Guy Van den Broeck
2020 Neural Information Processing Systems  
., on distributions over mixed continuous-discrete random variables and in the presence of complex logical and arithmetic constraints.  ...  In this work, we advance the WMI framework on both the theoretical and algorithmic side.  ...  Acknowledgement The authors would like to thank Arthur Choi for several insightful discussions about the RCR framework.  ... 
dblp:conf/nips/ZengMYVB20 fatcat:rdy33pjrpvb3vbgcdoygguty74

Exact Closest String as a Constraint Satisfaction Problem

Tom Kelsey, Lars Kotthoff
2011 Procedia Computer Science  
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems.  ...  We describe algorithms for web-scale distributed solution of closest string problems, both purely based on AI backtrack search and also hybrid numeric-AI methods.  ...  of closest string problems formalised as Constraint Satisfaction problems.  ... 
doi:10.1016/j.procs.2011.04.113 fatcat:x3oytlfpqzgwfnljzgt4u4pglq

Identifying Efficiently Solvable Cases of Max CSP [chapter]

David Cohen, Martin Cooper, Peter Jeavons, Andrei Krokhin
2004 Lecture Notes in Computer Science  
In this paper we study the complexity of the maximum constraint satisfaction problem (Max CSP) over an arbitrary finite domain.  ...  Until now, the only known polynomial-time solvable cases for this form of optimization problem were restricted to constraints over a 2-valued (Boolean) domain.  ...  This algebraic description of the characterization has also proved to be a key step in the analysis of the counting constraint satisfaction problem [5] and the quantified constraint satisfaction problem  ... 
doi:10.1007/978-3-540-24749-4_14 fatcat:k2fq6aljyzan3e2hn376u6zley

The Complexity of Valued Constraint Satisfaction

Peter Jeavons, Andrei A. Krokhin, Stanislav Zivný
2014 Bulletin of the European Association for Theoretical Computer Science  
We survey recent results on the broad family of problems that can be cast as valued constraint satisfaction problems.  ...  We discuss general methods for analysing the complexity of such problems, give examples of tractable cases, and identify general features of the complexity landscape.  ...  Approximation Since many forms of valued constraint satisfaction problem are NP-hard, it is natural to study approximation algorithms for these problems, and their limits.  ... 
dblp:journals/eatcs/JeavonsKZ14 fatcat:3m6natv2pnbdrhawutfcka4xbe

Craft: a constraint-based random-number generator

Ian Horswill
2015 International Conference on Foundations of Digital Games  
Despite the exponential complexity of the algorithm, the algorithm performs well on design-inspired problems at realistic scales.  ...  In this paper I describe Craft, a floating-point constraint solver that generates sets of random numbers satisfying designerspecified algebraic constraints.  ...  Acknowledgements I'd like to thank Robert Zubek, and the reviewers for their helpful comments and suggestions. Their attention is much appreciated.  ... 
dblp:conf/fdg/Horswill15 fatcat:dngfezrk6zhlnkxuqbm5jhjkgm

Reasoning with Numeric and Symbolic Time Information

Malek Mouhoub
2004 Artificial Intelligence Review  
These methods are exact and approximation algorithms based respectively on constraint satisfaction techniques and local search.  ...  The results demonstrate the efficiency of the MCRW approximation method to deal with under constrained and middle constrained problems while Tabu Search and SDRW are the methods of choice for over constrained  ...  Methods for solving an MTCSP include exact algorithms based on branch-and-bound techniques and approximation methods based on local search.  ... 
doi:10.1023/b:aire.0000007179.60276.39 fatcat:aqscy4t2vzdc3bbqch6z6ej36y

The Exact Closest String Problem as a Constraint Satisfaction Problem [article]

Tom Kelsey, Lars Kotthoff
2010 arXiv   pre-print
We report (to our knowledge) the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems.  ...  We describe algorithms for web-scale distributed solution of closest string problems, both purely based on AI backtrack search and also hybrid numeric-AI methods.  ...  Ian Miguel, and with various attendees at the International Society for Computational Biology's Latin America meeting held in Montevideo, Uruguay in March 2010.  ... 
arXiv:1005.0089v1 fatcat:aanus3otczfmnhlmssocx5eirm

Consistency techniques for continuous constraints

D. Sam-Haroud, B. Faltings
1996 Constraints  
., EPFL) for interesting discussions related to civil engineering, Peter van Beek (University of Alberta, CA), and Gaston Gonnet (ETHZ) for many helpful comments on this work, as well as the Swiss National  ...  Science Foundation for sponsoring this research under contract No.5003-034269.  ...  For composition, it is possible to show that the projection of a constraint into a higherdimensional space is exact for both inner and outer approximations.  ... 
doi:10.1007/bf00143879 fatcat:yzkx2dslsnag7krzc4ziu7oisq
« Previous Showing results 1 — 15 out of 4,958 results