Titre (en)
Exploration
Accueil
Racine
Exploration
Accueil
Racine

Serveur d'exploration sur la recherche en informatique en Lorraine - Exploration (Accueil)

Index « Titre (en) » - entrée « solving »
Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.
solvers < solving < som  Facettes :

List of bibliographic references indexed by solving

Number of relevant bibliographic references: 165.
[0-20] [0 - 20][0 - 50][20-40]
Ident.Authors (with country if any)Title
000063 (2016-02-22) Jilles Steeve Dibangoye [France] ; Christopher Amato [États-Unis] ; Olivier Buffet [France] ; François Charpillet [France]Optimally Solving Dec-POMDPs as Continuous-State MDPs
000096 (2016-01) Rémi Imbach [France] ; Pascal Mathis [France] ; Pascal Schreck [France]A Robust and Efficient Method for Solving Point Distance Problems by Homotopy
000377 (2015-08-25) Hadrien Bride [France] ; Olga Kouchnarenko [France] ; Fabien Peureux [France]Constraint Solving for Verifying Modal Specifications of Workflow Nets with Data
000494 (2015-06-17) Yacine Bouzidi [France] ; Sylvain Lazard [France] ; Guillaume Moroz [France] ; Marc Pouget [France] ; Fabrice Rouillier [France] ; Michael Sagraloff [Allemagne]Improved algorithms for solving bivariate systems via Rational Univariate Representations
000702 (2015) Carlos Areces [Argentine] ; Pascal Fontaine [France] ; Stephan Merz [France]Modal Satisfiability via SMT Solving
000960 (2014-09-09) Hadrien Bride [France] ; Olga Kouchnarenko [France] ; Fabien Peureux [France]Verifying Modal Workflow Specifications Using Constraint Solving
000C33 (2014-04) Jilles Steeve Dibangoye [France] ; Christopher Amato [États-Unis] ; Olivier Buffet [France] ; François Charpillet [France]Optimally solving Dec-POMDPs as Continuous-State MDPs: Theory and Algorithms
000C44 (2014-03-18) Yacine Bouzidi [France]Solving bivariate algebraic systems and topology of plane curves
000D68 (2014) Béatrice Fuchs [France] ; Jean Lieber [France] ; Alain Mille [France] ; Amedeo Napoli [France]Differential adaptation: An operational approach to adaptation for solving numerical problems with CBR
000D87 (2014) Kafil Hajlaoui [France] ; Jean-Charles Lamirel [France]A promising combination of approaches for solving complex text classification tasks: application to the classification of scientific papers into patents classes
001085 (2013-08-03) Jilles Steeve Dibangoye [France] ; Christopher Amato [États-Unis] ; Olivier Buffet [France] ; François Charpillet [France]Optimally Solving Dec-POMDPs as Continuous-State MDPs
001265 (2013-04) Jean-Charles Faugère [France] ; Pierrick Gaudry [France] ; Louise Huot [France] ; Guénaël Renault [France]Polynomial Systems Solving by Fast Linear Algebra
001376 (2013) Vincent Cheval [Royaume-Uni] ; Véronique Cortier [France] ; Stéphanie Delaune [France]Deciding equivalence-based properties using constraint solving
001580 (2013) Konstantin Korovin [Royaume-Uni]From Resolution and DPLL to Solving Arithmetic Constraints
001A69 (2012-06-24) Ehtesham Zahoor [France] ; Olivier Perrin [France] ; Claude Godart [France]Web services composition verification using satisfiability solving
002222 (2011-07-18) Carlos Sarraute [Argentine] ; Olivier Buffet [France] ; Joerg Hoffmann [France]Penetration Testing == POMDP Solving?
002847 (2011) Matthieu Godichaud [France] ; Elodie Chanthery [France] ; Olivier Buffet [France] ; Marc Contat [France]Formalizing and Solving Information Collection Problems with Autonomous Sensor Systems
002911 (2010-12-10) Olivier Simonin [France]Contribution to collective problem solving in multi-agent and multi-robot systems : models of self-organization based on direct and indirect interactions
002E76 (2010) Nazim Fatès [France]Solving the Decentralised Gathering Problem with a Reaction-Diffusion-Chemotaxis scheme - Social amoebae as a source of inspiration
002F99 (2010) Amedeo Napoli [France]Why and How Knowledge Discovery Can Be Useful for Solving Problems with CBR
003030 (2010) Michael Codish [Israël] ; Jürgen Giesl [Allemagne] ; Peter Schneider-Kamp [Danemark] ; René Thiemann [Autriche]SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration

HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/Title.i -k "solving" 

HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/Title.i  \
                -Sk "solving" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Exploration
   |type=    indexItem
   |index=    Title.i
   |clé=    solving
}}
Wicri

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022