90 Hits in 3.3 sec

Revisiting Neighborhood Inverse Consistency on Binary CSPs [chapter]

Robert J. Woodward, Shant Karakashian, Berthe Y. Choueiry, Christian Bessiere
2012 Lecture Notes in Computer Science  
We then study, in this context, Relational Neighborhood Inverse Consistency (RNIC), which is a consistency property that we had introduced for non-binary CSPs [17] .  ...  Our goal is to investigate the definition and application of strong consistency properties on the dual graphs of binary Constraint Satisfaction Problems (CSPs).  ...  Experiments were conducted on the equipment of the Holland Computing Center at the University of Nebraska-Lincoln.  ... 
doi:10.1007/978-3-642-33558-7_50 fatcat:xpsygjzqkjfrdedae4uwm3q6ze

Examining DCSP coordination tradeoffs

Michael Benisch, Norman Sadeh
2006 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems - AAMAS '06  
We present empirical results on solvable 3-coloring and random binary DCSP problems, that accurately capture the computational and communication tradeoffs between ABT and various mediation based approaches  ...  We present different mediation session selection rules, including a rule that favors smaller mediation sessions, and different mediation strategies, including a decentralized hybrid strategy based on ABT  ...  Results on Random CSP Instances The NCCC results on random CSP instances are shown in Figures 5(a) and 5(c).  ... 
doi:10.1145/1160633.1160896 dblp:conf/atal/BenischS06 fatcat:6wnjbl4xjjcqbjxdeijn56mwlu

On Sparse Discretization for Graphical Games

Luis E. Ortiz
2020 Journal of Artificial Intelligence Research  
In particular, a uniform discretization of size linear in the inverse of the approximation error and in the natural game-representation parameters suffices.  ...  In this particular case, a graph, a binary action set, and a set of local payoff matrices, or, equivalently, utility functions, define the game.  ...  on computational game theory at the University of Pennsylvania ( teaching/cgt/).  ... 
doi:10.1613/jair.1.12391 dblp:journals/jair/Ortiz20 fatcat:mmioqzuxnjdjlke5uscl5ro3im

Second-Order Configuration of Local Features for Geometrically Stable Image Matching and Retrieval

Xiaomeng Wu, Kunio Kashino
2015 IEEE transactions on circuits and systems for video technology (Print)  
the basis of their spatial neighborhood information.  ...  We revisit affine shape adaptation and extend its conclusion to characterize the geometrically stable feature of each tuple.  ...  On the other hand, MSDT-ASA2 did not perform as well as kNN-ASA2 and CSP-ASA2.  ... 
doi:10.1109/tcsvt.2014.2382985 fatcat:z473eu53pjbl5oxbkldjtb5ndq

On Sparse Discretization for Graphical Games [article]

Luis E. Ortiz
2014 arXiv   pre-print
, a uniform discretization size linear on the inverse of the approximation quality and natural game-representation parameters suffices.  ...  This short paper concerns discretization schemes for representing and computing approximate Nash equilibria, with emphasis on graphical games, but briefly touching on normal-form and poly-matrix games.  ...  Section 7 revisits this point.  ... 
arXiv:1411.3320v1 fatcat:laaiabavarfxfjsoo4govexunu

Soft arc consistency revisited

M.C. Cooper, S. de Givry, M. Sanchez, T. Schiex, M. Zytnicki, T. Werner
2010 Artificial Intelligence  
Constraint Satisfaction Problem (CSP) derived from the original cost function network.  ...  These algorithms have been implemented and evaluated on a variety of problems, including two difficult frequency assignment problems which are solved to optimality for the first time.  ...  CSP given in [37] .  ... 
doi:10.1016/j.artint.2010.02.001 fatcat:4eniod6dqzhtzp62vi5rztejme

Algebraic Attacks against Random Local Functions and Their Countermeasures

Benny Applebaum, Shachar Lovett
2018 SIAM journal on computing (Print)  
., each y i should depend on at most d = O(1) bits of x.  ...  Our goal in this paper is to understand, for any value of s, how the pseudorandomness of the resulting sequence depends on the choice of the underlying predicate.  ...  ., the non-marked neighborhood of A 2 ).  ... 
doi:10.1137/16m1085942 fatcat:kddt6vihp5fd3fivtguqe4k2ja

Algebraic attacks against random local functions and their countermeasures

Benny Applebaum, Shachar Lovett
2016 Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2016  
., each y i should depend on at most d = O(1) bits of x.  ...  Our goal in this paper is to understand, for any value of s, how the pseudorandomness of the resulting sequence depends on the choice of the underlying predicate.  ...  ., the non-marked neighborhood of A 2 ).  ... 
doi:10.1145/2897518.2897554 dblp:conf/stoc/ApplebaumL16 fatcat:gntvlamfjjce3pacq7nohp7voe

Message Passing and Combinatorial Optimization [article]

Siamak Ravanbakhsh
2015 arXiv   pre-print
The quality of the resulting message passing procedure, called Belief Propagation (BP), depends on the influence of loops in the graphical model.  ...  on a pairwise binary model.  ...  The model consists of binary variables (x i ∈ {−1, 1}) -denoting magnet spins -arranged on the nodes of a graph G = (V, E) (usually a grid or Cayley tree).  ... 
arXiv:1508.05013v1 fatcat:qtgk3j6pyfd4jhst4lvul2j3fa

Dismantlability, connectedness, and mixing in relational structures [article]

Raimundo Briceño, Andrei Bulatov, Victor Dalmau, Benoit Larose
2020 arXiv   pre-print
In this paper we go a step further and demonstrate similar connections for arbitrary CSPs.  ...  Topological properties of the solution set such as connectedness are related to the hardness of CSPs over random structures.  ...  for approximation of partition functions based only on local neighborhoods of variables [24, 54] .  ... 
arXiv:1901.04398v3 fatcat:iodsc5e3x5cmdnlp4oiy4munx4

Bridging the gap between planning and scheduling

2000 Knowledge engineering review (Print)  
One cannot specify the duration of an action or specify time constraints on either goals or actions.  ...  The planner starts with the world state consisting of the initial conditions, chooses an operator whose preconditions are satisfied in that state, and constructs a new state by adding the effects of the  ...  Acknowledgements Thanks to John Bresina, Carla Gomes, Keith Golden, Dan Weld, and two anonymous reviewers for comments on earlier drafts of this paper  ... 
doi:10.1017/s0269888900001089 fatcat:kfnjhgvgine5rbxgyisvzosdpu

Theta phase coding in a network model of the entorhinal cortex layer II with entorhinal-hippocampal loop connections

Jun Igarashi, Hatsuo Hayashi, Katsumi Tateno
2006 Cognitive Neurodynamics  
To this end, we propose a neural network based retrainable framework for object recognition, which consists of four components-preprocessing, binary classification, object identification, and outlier rejection  ...  transmission delay was 20 ms, based on physiological data.  ...  The results demonstrated that the circuits synchronized with in-and anti-phase depending on coupling strengths.  ... 
doi:10.1007/s11571-006-9003-8 pmid:19003510 pmcid:PMC2267667 fatcat:avihqfr6a5e7tm43lythi27n3a

On the Robustness of Domain Constraints [article]

Ryan Sheatsley and Blaine Hoak and Eric Pauley and Yohan Beugin and Michael J. Weisman and Patrick McDaniel
2021 arXiv   pre-print
Government is authorized to reproduce and distribute reprints for Government purposes not withstanding any copyright notation here on.  ...  ACKNOWLEDGMENTS The authors would like to warmly thank the reviewers for their insightful feedback and Quinn Burke for his feedback on versions of this paper.  ...  The Constrained-Saliency Projection (CSP). The CSP is our approach.  ... 
arXiv:2105.08619v2 fatcat:2ou2siixtfbclazd2frkvf7vqa

EEG Source Analysis [chapter]

Marco Congedo, Leslie Sherlin
2011 Neurofeedback and Neuromodulation Techniques and Applications  
Useful suggestions on the use of inverse solutions are provided.  ...  Chapter III introduces the family of regularized weighted minimum-norm inverse solutions. It addresses thus the problem of source localization.  ...  The MDM method applies to both the binary and multiclass classification. As state of the art competitors we used the CSP+LDA for binary classification and the BSS+LG for multiclass classification.  ... 
doi:10.1016/b978-0-12-382235-2.00002-0 fatcat:4to7kmjd4rcj3lfv2qwhkgpjui

A graph solver for the automated generation of consistent domain-specific models

Oszkár Semeráth, András Szabolcs Nagy, Dániel Varró
2018 Proceedings of the 40th International Conference on Software Engineering - ICSE '18  
Many testing and benchmarking scenarios in software and systems engineering depend on the systematic generation of graph models.  ...  For instance, tool qualification necessitated by safety standards would require a large set of consistent (well-formed or malformed) instance models specific to a domain.  ...  To our best knowledge, our framework is one of the first attempts to automatically generate consistent models by operating natively over (typed and attributed) graphs.  ... 
doi:10.1145/3180155.3180186 dblp:conf/icse/SemerathNV18 fatcat:ogeejaydxbeirlugigth5o2qgq
« Previous Showing results 1 — 15 out of 90 results