Christophe Ringeissen - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

[Clear Filters]

Publications tagged rewriting strategies

Minimization strategies for maximally parallel multiset rewriting systemsArtiom Alhazov, Sergey Verlan. TCS, 412(17):1581-1591, 2011. [doi]

A Formal Resolution Strategy for Operation-Based Conflicts in Model Versioning Using Graph ModificationsHartmut Ehrig, Claudia Ermel, Gabriele Taentzer. FASE 2011: 202-216 [doi]

A Multilevel Scheme with Adaptive Memory Strategy for Multiway Graph PartitioningHideki Hashimoto, Youhei Sonobe, Mutsunori Yagiura. lion 2010: 188-191 [doi]

A Novel Branching Strategy for Parameterized Graph Modification ProblemsJames Nastos, Yong Gao. cocoa 2010: 332-346 [doi]

Termination of rewriting under strategiesIsabelle Gnaedig, Hélène Kirchner. tocl, 10(2), 2009. [doi]

Admissible Strategies in Infinite Games over GraphsMarco Faella. mfcs 2009: 307-318 [doi]

Shifting Strategy for Geometric Graphs without GeometryImran A. Pirwani. isaac 2009: 362-371 [doi]

Using Rewrite Strategies for Testing BUpL AgentsLacramioara Astefanoaei, Frank S. de Boer, M. Birna van Riemsdijk. LOPSTR 2010: 143-157 [doi]

A Strategy for Evolutionary Spanning Tree Construction within Constrained Graphs with Application to Electrical NetworksSantiago Vazquez-Rodriguez, Richard J. Duro. iwinac 2009: 459-468 [doi]

A Rewriting Semantics for Maude StrategiesNarciso Martí-Oliet, José Meseguer, Alberto Verdejo. ENTCS, 238(3):227-247, 2009. [doi]

On Term-Graph Rewrite StrategiesRachid Echahed. ENTCS, 204:99-110, 2008. [doi]

Structured strategies in games on graphsRamaswamy Ramanujam, Sunil Easaw Simon. BIRTHDAY 2008: 553-574

A Novel Strategy Using Factor Graphs and the Sum-Product Algorithm for Satellite Broadcast Scheduling ProblemsJung-Chieh Chen. ieicet, 91-B(3):927-930, 2008. [doi]

Deduction, Strategies, and RewritingSteven Eker, Narciso Martí-Oliet, José Meseguer, Alberto Verdejo. ENTCS, 174(11):3-25, 2007. [doi]

Dynamic Grouping Strategies Based on a Conceptual Graph for Cooperative LearningBinShyan Jong, YuLung Wu, TeYi Chan. tkde, 18(6):738-747, 2006. [doi]

A novel broadcast scheduling strategy using factor graphs and the sum-product algorithmJung-Chieh Chen, Yeong-Cheng Wang, Jiunn-Tsair Chen. TWC, 5(6):1241-1249, 2006. [doi]

Tree automata for rewrite strategiesPierre Réty, Julie Vuotto. JSC, 40(1):749-794, 2005. [doi]

Reduction Strategies for Left-Linear Term Rewriting SystemsYoshihito Toyama. BIRTHDAY 2005: 198-223 [doi]

Heuristic Colour Assignment Strategies for Merge Models in Graph ColouringIstván Juhos, Attila Tóth, Jano I. van Hemert. evoW 2005: 132-143 [doi]

A Detailed Study of the Attachment Strategies of New Autonomous Systems in the AS Connectivity GraphIngrid Daubechies, Konstantinos Drakakis, Tanya Khovanova. im, 2(2):185-246, 2005.

Reduction strategies in rewriting and programmingBernhard Gramlich, Salvador Lucas. JSC, 40(1):745-747, 2005. [doi]

A rewriting strategy for protocol verificationMonica Nesi, Giuseppina Rucci, Massimo Verdesca. ENTCS, 86(4):657-672, 2003. [doi]

3rd International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2003) - Final ProceedingsBernhard Gramlich, Salvador Lucas. ENTCS, 86(4):567-569, 2003. [doi]

Swap Strategies for Graph MatchingPaolo Fosser, Roland Glantz, Marco Locatelli, Marcello Pelillo. gbrpr 2003: 142-153 [doi]

Applying Crossing Reduction Strategies to Layered Compound GraphsMichael Forster. gd 2002: 276-284 [doi]

Regular Sets of Descendants by Some Rewrite StrategiesPierre Réty, Julie Vuotto. RTA 2002: 129-143 [doi]

Symbolic Strategy Synthesis for Games on Pushdown GraphsThierry Cachat. icalp 2002: 704-715 [doi]

Context-Sensitive Rewriting StrategiesSalvador Lucas. iandc, 178(1):294-343, 2002. [doi]

Probabilistic Rewrite Strategies. Applications to ELANOlivier Bournez, Claude Kirchner. RTA 2002: 252-266 [doi]

Rewriting with Strategies in ELAN: A Functional SemanticsPeter Borovanský, Claude Kirchner, Hélène Kirchner, Christophe Ringeissen. ijfcs, 12(1):69-95, 2001.

Termination of Rewriting with Local StrategiesOlivier Fissore, Isabelle Gnaedig, Hélène Kirchner. TCS, 58(2):155-188, 2001. [doi]

Termination of Rewriting With Strategy AnnotationsSalvador Lucas. lpar 2001: 669-684 [doi]

1st International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2001) - PrefaceBernhard Gramlich, Salvador Lucas. TCS, 57:201-202, 2001. [doi]

Constrained Graph Drawing with Evolution StrategiesP. Simula, Ilkka Karanta, Mikko Hiirsalmi. icscCd 1999:

The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphsCees Duin, Stefan Voß. networks, 34(3):181-191, 1999. [doi]

Improving bipartite graphs using multi-strategy simulated annealingPanagiotis K. Linos, Michael Breen. ACMse 1999: [doi]

Term rewriting with operator evaluation strategiesSteven Eker. ENTCS, 15:311-330, 1998. [doi]

A Functional View of Rewriting and Strategies for a Semantics of ELANPeter Borovanský, Claude Kirchner, Hélène Kirchner. FLOPS 1998: 143-166

Controlling rewriting: study and implementation of a strategy formalismPeter Borovanský. ENTCS, 15:299-310, 1998. [doi]

Optimizing Cut-and-Paste on Directed Graphs, with a User-Controlled Edge Reconstruction StrategyBertrand Ibrahim. vl 1998: 90-91

Implementation of Term Rewritings with the Evaluation StrategyKazuhiro Ogata, Kokichi Futatsugi. plilp 1997: 225-239

Extremal paths in graphs - foundations, search strategies and related topicsUlrich Huckenbeck. Akademie Verlag, 1997.

The Majority Strategy on GraphsHenry Martyn Mulder. DAM, 80(1):97-105, 1997. [doi]

On a Simple Depth-First Search Strategy for Exploring Unknown GraphsStephen Kwek. wads 1997: 345-353

A Winning Strategy for the Ramsey Graph GameAleksandar Pekec. cpc, 5:267-276, 1996.

Narrowing Strategies for Arbitrary Canonical Rewrite SystemsAlexander Bockmayr, Stefan Krischer, Andreas Werner. FUIN, 24(1/2):125-155, 1995.

Development of Rewriting StrategiesAlexander A. Letichevsky. plilp 1993: 378-390

Strategies for Interconnection Networks: Some Methods from Graph TheoryJean-Claude Bermond, Charles Delorme, Jean-Jacques Quisquater. jpdc, 3(4):433-449, 1986.

Good Rewrite Strategies for FPJoseph Y. Halpern, John H. Williams, Edward L. Wimmers. lics 1986: 149-162

Selection Heuristics, Deletion Strategies and N-Level Terminator Configurations for the Connection Graph Proof ProcedureJörg H. Siekmann, Gert Smolka. ki 1981: 199-200

runs on WebDSL