default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnastasia Paparrizou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c18]Frédéric Koriche, Christophe Lecoutre, Anastasia Paparrizou, Hugues Wattez:
Best Heuristic Identification for Constraint Satisfaction. IJCAI 2022: 1859-1865- 2021
- [j7]Michael Sioutis, Anastasia Paparrizou, Tomi Janhunen:
On neighbourhood singleton-style consistencies for qualitative spatial and temporal reasoning. Inf. Comput. 280: 104638 (2021) - 2020
- [c17]Anastasia Paparrizou, Hugues Wattez
:
Perturbing Branching Heuristics in Constraint Solving. CP 2020: 496-513 - [c16]Hugues Wattez, Frédéric Koriche, Christophe Lecoutre, Anastasia Paparrizou, Sébastien Tabary:
Learning Variable Ordering Heuristics with Multi-Armed Bandits and Restarts. ECAI 2020: 371-378
2010 – 2019
- 2019
- [j6]Michael Sioutis, Anastasia Paparrizou, Jean-François Condotta:
Collective singleton-based consistency for qualitative constraint networks: Theory and practice. Theor. Comput. Sci. 797: 17-41 (2019) - [c15]Hugues Wattez, Christophe Lecoutre, Anastasia Paparrizou, Sébastien Tabary:
Refining Constraint Weighting. ICTAI 2019: 71-77 - [c14]Michael Sioutis, Anastasia Paparrizou, Tomi Janhunen:
On the Utility of Neighbourhood Singleton-Style Consistencies for Qualitative Constraint-Based Spatial and Temporal Reasoning. TIME 2019: 14:1-14:17 - 2017
- [j5]Christian Bessiere, Luc De Raedt, Tias Guns, Lars Kotthoff, Mirco Nanni, Siegfried Nijssen, Barry O'Sullivan, Anastasia Paparrizou, Dino Pedreschi, Helmut Simonis:
The Inductive Constraint Programming Loop. IEEE Intell. Syst. 32(5): 44-52 (2017) - [c13]Jean-Marie Lagniez, Pierre Marquis, Anastasia Paparrizou:
Defining and Evaluating Heuristics for the Compilation of Constraint Networks. CP 2017: 172-188 - [c12]Michael Sioutis, Anastasia Paparrizou, Jean-François Condotta:
A Lazy Algorithm to Efficiently Approximate Singleton Path Consistency for Qualitative Constraint Networks. ICTAI 2017: 110-117 - [c11]Anastasia Paparrizou, Kostas Stergiou:
On Neighborhood Singleton Consistencies. IJCAI 2017: 736-742 - [c10]Michael Sioutis, Anastasia Paparrizou, Jean-François Condotta:
Collective Singleton-Based Consistency for Qualitative Constraint Networks. TIME 2017: 19:1-19:17 - 2016
- [j4]Anastasia Paparrizou, Kostas Stergiou:
Strong local consistency algorithms for table constraints. Constraints An Int. J. 21(2): 163-197 (2016) - [c9]Christian Bessiere, Remi Coletta, Gaelle Hisler, Anastasia Paparrizou:
Complexity Results in Optimistic/Pessimistic Preference Reasoning. ICTAI 2016: 930-937 - [p2]Amine Balafrej, Christian Bessiere, Anastasia Paparrizou, Gilles Trombettoni:
Adapting Consistency in Constraint Solving. Data Mining and Constraint Programming 2016: 226-253 - [p1]Christian Bessiere, Luc De Raedt, Tias Guns, Lars Kotthoff, Mirco Nanni, Siegfried Nijssen, Barry O'Sullivan, Anastasia Paparrizou, Dino Pedreschi, Helmut Simonis:
The Inductive Constraint Programming Loop. Data Mining and Constraint Programming 2016: 303-309 - 2015
- [j3]Anastasia Paparrizou:
Efficient algorithms for strong local consistencies and adaptive techniques in constraint satisfaction problems. Constraints An Int. J. 20(4): 484-485 (2015) - [c8]Christian Bessiere, Anastasia Paparrizou, Kostas Stergiou:
Strong Bounds Consistencies and Their Application to Linear Constraints. AAAI 2015: 3717-3723 - [c7]Amine Balafrej, Christian Bessiere, Anastasia Paparrizou:
Multi-Armed Bandits for Adaptive Constraint Propagation. IJCAI 2015: 290-296 - [i3]Christian Bessiere, Luc De Raedt, Tias Guns, Lars Kotthoff, Mirco Nanni, Siegfried Nijssen, Barry O'Sullivan, Anastasia Paparrizou, Dino Pedreschi, Helmut Simonis:
The Inductive Constraint Programming Loop. CoRR abs/1510.03317 (2015) - 2013
- [b1]Anastasia Paparrizou:
Efficient algorithms for strong local consistencies and adaptive techniques in constraint satisfaction problems. University of Western Macedonia, Greece, 2013 - [c6]Christophe Lecoutre, Anastasia Paparrizou, Kostas Stergiou:
Extending STR to a Higher-Order Consistency. AAAI 2013: 576-582 - [c5]Anastasia Paparrizou:
Efficient Algorithms for Strong Local Consistencies in Constraint Satisfaction Problems. AAAI 2013: 1674-1675 - 2012
- [c4]Anastasia Paparrizou, Kostas Stergiou:
An Efficient Higher-Order Consistency Algorithm for Table Constraints. AAAI 2012: 535-541 - [c3]Anastasia Paparrizou, Kostas Stergiou:
Evaluating Simple Fully Automated Heuristics for Adaptive Constraint Propagation. ICTAI 2012: 880-885 - [c2]Anastasia Paparrizou, Kostas Stergiou:
Extending Generalized Arc Consistency. SETN 2012: 174-181 - 2011
- [j2]Thanasis Balafoutis, Anastasia Paparrizou, Kostas Stergiou, Toby Walsh:
New algorithms for max restricted path consistency. Constraints An Int. J. 16(4): 372-406 (2011) - 2010
- [c1]Thanasis Balafoutis, Anastasia Paparrizou, Kostas Stergiou, Toby Walsh:
Improving the Performance of maxRPC. CP 2010: 69-83 - [i2]Thanasis Balafoutis, Anastasia Paparrizou, Kostas Stergiou, Toby Walsh:
Improving the Performance of maxRPC. CoRR abs/1008.5189 (2010) - [i1]Thanasis Balafoutis, Anastasia Paparrizou, Kostas Stergiou:
Experimental Evaluation of Branching Schemes for the CSP. CoRR abs/1009.0407 (2010)
2000 – 2009
- 2009
- [j1]Basil D. Manos, Jason Papathanasiou, Thomas Bournaris, Anastasia Paparrizou, G. Arabatzis:
Simulation of impacts of irrigated agriculture on income, employment and environment. Oper. Res. 9(3): 251-266 (2009)
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-25 21:12 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:
