default search action
Justin Pearson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j20]Kamran Forghani
, Mats Carlsson, Pierre Flener, Magnus Fredriksson, Justin Pearson, Di Yuan:
Maximizing value yield in wood industry through flexible sawing and product grading based on wane and log shape. Comput. Electron. Agric. 216: 108513 (2024) - 2022
- [j19]Barnaby Martin, Justin Pearson
When bounds consistency implies domain consistency for regular counting constraints. Constraints An Int. J. 27(3): 161-167 (2022) - 2020
- [c53]Gustav Björdal
Solving Satisfaction Problems Using Large-Neighbourhood Search. CP 2020: 55-71
2010 – 2019
- 2019
- [c52]Gustav Björdal
Exploring Declarative Local-Search Neighbourhoods with Constraint Programming. CP 2019: 37-53 - [c51]Gustav Björdal
Generating Compound Moves in Local Search by Hybridisation with Complete Search. CPAIOR 2019: 95-111 - 2018
- [b1]Justin Pearson:
Control under energy and time constraints. University of California, Santa Barbara, USA, 2018 - [c50]Gustav Björdal
Declarative Local-Search Neighbourhoods in MiniZinc. ICTAI 2018: 98-105 - [c49]Catherine Dubois, Olga Grinchtein, Justin Pearson, Mats Carlsson:
Exploring Properties of a Telecommunication Protocol with Message Delay Using Interactive Theorem Prover. SEFM 2018: 239-253 - 2017
- [j18]Justin Pearson
Control With Minimal Cost-Per-Symbol Encoding and Quasi-Optimality of Event-Based Encoders. IEEE Trans. Autom. Control. 62(5): 2286-2301 (2017) - [c48]Joseph D. Scott, Pierre Flener, Justin Pearson, Christian Schulte:
Design and Implementation of Bounded-Length Sequence Variables. CPAIOR 2017: 51-67 - [c47]María Andreína Francisco Rodríguez
Automatic Generation of Descriptions of Time-Series Constraints. ICTAI 2017: 102-109 - [c46]Mats Carlsson, Olga Grinchtein, Justin Pearson:
Modelling and Verification of User Interactions Using Constraint Programming. QRS Companion 2017: 541-547 - 2016
- [j17]Jean-Noël Monette
A parametric propagator for pairs of Sum constraints with a discrete convexity property. Artif. Intell. 241: 170-190 (2016) - [c45]Ekaterina Arafailova, Nicolas Beldiceanu, Mats Carlsson, Pierre Flener
Systematic Derivation of Bounds and Glue Constraints for Time-Series Constraints. CP 2016: 13-29 - [c44]Ekaterina Arafailova, Nicolas Beldiceanu, Rémi Douence, Pierre Flener
Time-Series Constraints: Improvements and Application in CP and MIP Contexts. CPAIOR 2016: 18-34 - [c43]Roberto Amadini, Pierre Flener, Justin Pearson, Joseph D. Scott, Peter J. Stuckey
MiniZinc with Strings. LOPSTR 2016: 59-75 - [i5]Roberto Amadini, Pierre Flener, Justin Pearson, Joseph D. Scott, Peter J. Stuckey, Guido Tack:
MiniZinc with Strings. CoRR abs/1608.03650 (2016) - [i4]Ekaterina Arafailova, Nicolas Beldiceanu, Rémi Douence, Mats Carlsson, Pierre Flener, María Andreína Francisco Rodríguez
Global Constraint Catalog, Volume II, Time-Series Constraints. CoRR abs/1609.08925 (2016) - 2015
- [j16]Gustav Björdal
A constraint-based local search backend for MiniZinc. Constraints An Int. J. 20(3): 325-345 (2015) - [c42]Justin Pearson, João Pedro Hespanha, Daniel Liberzon:
Quasi-optimality of event-based encoders. CDC 2015: 4800-4805 - [c41]Jean-Noël Monette, Pierre Flener
Automated Auxiliary Variable Elimination Through On-the-Fly Propagator Generation. CP 2015: 313-329 - [c40]Joseph D. Scott, Pierre Flener
Constraint Solving on Bounded String Variables. CPAIOR 2015: 375-392 - [c39]Nicolas Beldiceanu, Mats Carlsson, Pierre Flener, Xavier Lorca, Justin Pearson, Thierry Petit, Charles Prud'homme:
A Modelling Pearl with Sortedness Constraints. GCAI 2015: 27-41 - [c38]María Andreína Francisco Rodríguez, Pierre Flener, Justin Pearson:
Implied Constraints for Automaton Constraints. GCAI 2015: 113-126 - [c37]Olga Grinchtein, Mats Carlsson, Justin Pearson:
Testing of a telecommunication protocol using constraint programming. ICST Workshops 2015: 1-3 - [c36]Olga Grinchtein, Mats Carlsson, Justin Pearson:
A Constraint Optimisation Model for Analysis of Telecommunication Protocol Logs. TAP@STAF 2015: 137-154 - 2014
- [j15]Nicolas Beldiceanu, Pierre Flener
Toward sustainable development in constraint programming. Constraints An Int. J. 19(2): 139-149 (2014) - [c35]Nicolas Beldiceanu, Pierre Flener, Justin Pearson, Pascal Van Hentenryck:
Propagating Regular Counting Constraints. AAAI 2014: 2616-2622 - [c34]Jean-Noël Monette, Pierre Flener, Justin Pearson:
A Propagator Design Framework for Constraints over Sequences. AAAI 2014: 2710-2716 - [c33]Justin Pearson, João Pedro Hespanha, Daniel Liberzon:
Control with minimum communication cost per symbol. CDC 2014: 6050-6055 - [c32]Nicolas Beldiceanu, Mats Carlsson, Pierre Flener
Linking Prefixes and Suffixes for Constraints Encoded Using Automata with Accumulators. CP 2014: 142-157 - [c31]Kenneth Balck, Olga Grinchtein, Justin Pearson:
Model-based protocol log generation for testing a telecommunication test harness using CLP. DATE 2014: 1-4 - [c30]Farshid Hassani Bijarbooneh, Animesh Pathak, Justin Pearson, Valérie Issarny, Bengt Jonsson:
A Constraint Programming Approach for Managing End-to-end Requirements in Sensor Network Macroprogramming. SENSORNETS 2014: 28-40 - [c29]Mats Carlsson, Olga Grinchtein, Justin Pearson:
Protocol Log Analysis with Constraint Programming. SMT 2014: 17-26 - [i3]Pierre Flener, Justin Pearson:
Propagators and Violation Functions for Geometric and Workload Constraints Arising in Airspace Sectorisation. CoRR abs/1401.7463 (2014) - 2013
- [j14]Nicolas Beldiceanu, Mats Carlsson, Pierre Flener
On the reification of global constraints. Constraints An Int. J. 18(1): 1-6 (2013) - [j13]Nicolas Beldiceanu, Mats Carlsson, Pierre Flener
On matrices, automata, and double counting in constraint programming. Constraints An Int. J. 18(1): 108-140 (2013) - [j12]Jun He, Pierre Flener
Underestimating the cost of a soft constraint is dangerous: revisiting the edit-distance based soft regular constraint. J. Heuristics 19(5): 729-756 (2013) - [c28]Jun He, Pierre Flener
Solving String Constraints: The Case for Constraint Programming. CP 2013: 381-397 - [c27]Jean-Noël Monette, Nicolas Beldiceanu, Pierre Flener
A Parametric Propagator for Discretely Convex Pairs of Sum Constraints. CP 2013: 529-544 - [c26]Joseph D. Scott, Pierre Flener
Bounded Strings for Constraint Programming. ICTAI 2013: 1036-1043 - [c25]María Andreína Francisco Rodríguez
Generation of Implied Constraints for Automaton-Induced Decompositions. ICTAI 2013: 1076-1083 - [c24]Farshid Hassani Bijarbooneh, Pierre Flener
Optimising quality of information in data collection for mobile sensor networks. IWQoS 2013: 163-172 - [i2]Nicolas Beldiceanu, Pierre Flener, Justin Pearson, Pascal Van Hentenryck:
Propagating Regular Counting Constraints. CoRR abs/1309.7145 (2013) - [i1]Pierre Flener, Justin Pearson:
Automatic Airspace Sectorisation: A Survey. CoRR abs/1311.0653 (2013) - 2012
- [j11]Pierre Flener
Constraint programming for air traffic management: preface. Knowl. Eng. Rev. 27(3): 287-289 (2012) - [j10]Cyril Allignol, Nicolas Barnier, Pierre Flener
Constraint programming for air traffic management: a survey - In memory of Pascal Brisset. Knowl. Eng. Rev. 27(3): 361-392 (2012) - [c23]Jean-Noël Monette, Pierre Flener
Towards Solver-Independent Propagators. CP 2012: 544-560 - [c22]Jun He, Pierre Flener
Solution neighbourhoods for constraint-directed local search. SAC 2012: 74-79 - [c21]Toni Mancini
Combinatorial problem solving over relational databases: view synthesis through constraint-based local search. SAC 2012: 80-87 - [c20]Farshid Hassani Bijarbooneh, Pierre Flener
An optimisation-based approach for wireless sensor deployment in mobile sensing environments. WCNC 2012: 2108-2112 - 2011
- [j9]Jun He, Pierre Flener
An automaton Constraint for Local Search. Fundam. Informaticae 107(2-3): 223-248 (2011) - 2010
- [c19]Karl Sundequist Blomdahl, Pierre Flener
Contingency Plans for Air Traffic Management. CP 2010: 643-657 - [c18]Nicolas Beldiceanu, Mats Carlsson, Pierre Flener
On Matrices, Automata, and Double Counting. CPAIOR 2010: 10-24
2000 – 2009
- 2009
- [j8]Pierre Flener
Static and dynamic structural symmetry breaking. Ann. Math. Artif. Intell. 57(1): 37-57 (2009) - [j7]Pierre Flener
Dynamic structural symmetry breaking for constraint satisfaction problems. Constraints An Int. J. 14(4): 506-538 (2009) - [j6]Magnus Ågren, Pierre Flener
Revisiting constraint-directed search. Inf. Comput. 207(3): 438-457 (2009) - [j5]Pierre Flener
Solving necklace constraint problems. J. Algorithms 64(2-3): 61-73 (2009) - [c17]Toni Mancini, Pierre Flener, Amir Hossein Monshi, Justin Pearson:
Constrained Optimization Over Massive Databases. RCRA@AI*IA 2009 - [c16]Jun He, Pierre Flener
Toward an automaton Constraint for Local Search. LSCS 2009: 13-25 - [c15]Farshid Hassani Bijarbooneh, Pierre Flener, Justin Pearson:
Dynamic Demand-Capacity Balancing for Air Traffic Management Using Constraint-Based Local Search: First Results. LSCS 2009: 27-40 - 2008
- [c14]Pierre Flener, Justin Pearson:
Solving Necklace Constraint Problems. ECAI 2008: 520-524 - 2007
- [j4]Pierre Flener
Design of Financial CDO Squared Transactions Using Constraint Programming. Constraints An Int. J. 12(2): 179-205 (2007) - [j3]Magnus Ågren, Pierre Flener
Generic Incremental Algorithms for Local Search. Constraints An Int. J. 12(3): 293-324 (2007) - 2006
- [c13]Magnus Ågren, Pierre Flener, Justin Pearson:
Inferring Variable Conflicts for Local Search. CP 2006: 665-669 - [c12]Pierre Flener, Justin Pearson, Meinolf Sellmann, Pascal Van Hentenryck:
Static and Dynamic Structural Symmetry Breaking. CP 2006: 695-699 - 2005
- [c11]Magnus Ågren, Pierre Flener, Justin Pearson:
Incremental Algorithms for Local Search from Existential Second-Order Logic. CP 2005: 47-61 - [c10]Magnus Ågren, Pierre Flener, Justin Pearson:
Set Variables and Local Search. CPAIOR 2005: 19-33 - [c9]Pascal Van Hentenryck, Pierre Flener, Justin Pearson, Magnus Ågren:
Compositional Derivation of Symmetries for Constraint Satisfaction. SARA 2005: 234-247 - 2004
- [c8]Pierre Flener, Justin Pearson, Luis G. Reyna:
Financial Portfolio Optimisation. CP 2004: 227-241 - [c7]Justin Pearson:
Symmetry Breaking in Constraint Satisfaction with Graph-Isomorphism: Comma-Free Codes. AI&M 2004 - 2003
- [c6]Pierre Flener
Introducing ESRA, a Relational Language for Modelling Combinatorial Problems. CP 2003: 971 - [c5]Pascal Van Hentenryck, Pierre Flener, Justin Pearson, Magnus Ågren:
Tractable Symmetry Breaking for CSPs with Interchangeable Values. IJCAI 2003: 277-284 - [c4]Pierre Flener, Justin Pearson, Magnus Ågren:
Introducing esra, a Relational Language for Modelling Combinatorial Problems. LOPSTR 2003: 214-232 - 2002
- [c3]Pierre Flener, Alan M. Frisch
Breaking Row and Column Symmetries in Matrix Models. CP 2002: 462-476
1990 – 1999
- 1999
- [j2]Kim Guldstrand Larsen, Justin Pearson, Carsten Weise, Wang Yi:
Clock Difference Diagrams. Nord. J. Comput. 6(3): 271-298 (1999) - [c2]Gerd Behrmann, Kim Guldstrand Larsen, Justin Pearson, Carsten Weise, Wang Yi:
Efficient Timed Reachability Analysis Using Clock Difference Diagrams. CAV 1999: 341-353 - [c1]Víctor Dalmau
Closure Functions and Width 1 Problems. CP 1999: 159-173 - 1998
- [j1]Peter Jeavons, David A. Cohen, Justin Pearson:
Constraints and Universal Algebra. Ann. Math. Artif. Intell. 24(1-4): 51-67 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: