Serveur d'exploration sur la recherche en informatique en Lorraine - Checkpoint (Istex)

Index « Titre (en) » - entrée « problem »
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.
probing < problem < problematic  Facettes :

List of bibliographic references

Number of relevant bibliographic references: 38.
[0-20] [0 - 20][0 - 38][20-37][20-40]
Ident.Authors (with country if any)Title
000122 (2013) Ammar Oulamara [France] ; Djamal Rebaine [Canada] ; Mehdi Serairi [France]Scheduling the two-machine open shop problem under resource constraints for setting the jobs
000379 (2012) Nazim Fatès [France]Stochastic Cellular Automata Solutions to the Density Classification Problem
000404 (2012) Silvija Vlah Jeri [Croatie] ; José Rui Figueira [Portugal, France]Multi-objective scheduling and a resource allocation problem in hospitals
000893 (2010) Gerold J Ger [Allemagne] ; Weixiong Zhang [États-Unis]A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem
000990 (2009) Wolfgang Thomas [Allemagne]The Reachability Problem over Infinite Graphs
000D68 (2008) A. Bendjoudi [Algérie] ; S. Guerdah [Algérie] ; M. Mansoura [Algérie] ; N. Melab [France] ; E. G. Talbi [France]P2P B&B and GA for the Flow-Shop Scheduling Problem
001096 (2007) Andreas Enge [France] ; Pierrick Gaudry [France]An L (1/3 +  ε ) Algorithm for the Discrete Logarithm Problem for Low Degree Curves
001113 (2007) Ernst Althaus [Allemagne] ; Stefan Canzar [France]A Lagrangian Relaxation Approach for the Multiple Sequence Alignment Problem
001573 (2005) Chevrier Vincent [France]From Self-Organized Systems to Collective Problem Solving
001867 (2004) Franz Baader ; Silvio Ghilardi ; Cesare Tinelli [États-Unis]A New Combination Procedure for the Word Problem That Generalizes Fusion Decidability Results in Modal Logics
001B67 (2002) O. Bournez ; M. Branicky [États-Unis]The Mortality Problem for Matrices of Low Dimensions
001E08 (2001) Alessandro Armando [Italie] ; Felice Peccia [Italie] ; Silvio Ranise [Italie, France]The Phase Transition of the Linear Inequalities Problem
001E26 (2001) Fabrice Rouillier [France] ; Mohab Safey El Din [France] ; Éric Schost [France]Solving the Birkhoff Interpolation Problem via the Critical Point Method: An Experimental Study
001E61 (2001) Laurent Alonso ; René SchottOn the tree inclusion problem
002069 (2000) Shay Kutten [Israël] ; Rafail Ostrovsky [Colombie] ; Boaz Patt-Shamir [Israël]The Las-Vegas Processor Identity Problem (How and When to Be Unique)
002095 (2000) Philippe De Groote [France]Proof-Search in Implicative Linear Logic as a Matching Problem
002147 (2000) Paul Gibson [Irlande (pays)] ; Dominique Méry [France]Formal Modelling of Services for Getting a Better Understanding of the Feature Interaction Problem
002396 (1999) Laurent Juban [France]Dichotomy theorem for the generalized unique satisfiability problem
002401 (1999) Franz Baader [Allemagne] ; Cesare Tinelli [États-Unis]Deciding the Word Problem in the Union of Equational Theories Sharing Constructors
002544 (1998) Christopher Lynch [États-Unis]The unification problem for one relation Thue Systems
002568 (1998) Miki Hermann [France] ; Gernot Salzer [Autriche]On the word, subsumption, and complement problem for recurrent term schematizations

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Checkpoint
HfdIndexSelect -h $EXPLOR_AREA/Data/Istex/Checkpoint/Title.i -k "problem" 
HfdIndexSelect -h $EXPLOR_AREA/Data/Istex/Checkpoint/Title.i  \
                -Sk "problem" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/Istex/Checkpoint/biblio.hfd 

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Istex
   |étape=   Checkpoint
   |type=    indexItem
   |index=    Title.i
   |clé=    problem
}}

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