„Logic Programming“

Suchergebnisse

2.836 Treffer

• Resource finding in store-and-forward networks
  Bernabéu-Aubán, José M. ; Ahamad, Mustaque ; Ammar, Mostafa H.
• A class of coders based on GSM
  Atanasiu, Adrian
• The expressive power of the bounded-iteration construct
  Qian, Xiaolei
• Languages accepted by systolic Y-tree automata: structural characterizations
  Fachini, E. ; Monti, A. ; Napoli, M. ; Parente, D.
• A fixed point approach to parallel discrete event simulation
  Pohlmann, Werner
• An efficiency preorder for processes
  Arun-Kumar, S. ; Hennessy, M.
• The connection between an event structure semantics and an operational semantics forTCSP
  Baier, Christel ; Majster-Cederbaum, Mila E.
• IEH graphs – A novel generalization of hypercube graphs
  Sur, Sumit ; Srimani, Pradip K.
• Proving finiteness of CCS processes by non-standard semantics
  Francesco, Nicoletta De ; Inverardi, Paola
• Contextual nets
  Montanari, Ugo ; Rossi, Francesca
• Dependency preservation in semantic databases
  Su, Jianwen
• Concurrent testing of processes
  Hennessy, M.
• Goal programming models for high-speed train crew scheduling problem
  Alakaş, Hacı Mehmet ; Eren, Tamer ; Yelek, Ayşe ; Özder, Emir Hüseyin
• Residuation and guarded rules for constraint logic programming
  Smolka, Gert 1991 DFKI
• Extensions to generalized disjunctive programming: hierarchical structures and first-order logic
  Perez, Hector D. ; Grossmann, Ignacio E.
• Mellin transforms and asymptotics – The mergesort recurrence
  Flajolet, Philippe ; Golin, Mordecai
• The analysis of heuristics for search trees
  Poblete, Patricio V.
• The relaxed min-max heap – A mergeable double-ended priority queue
  Ding, Yuzheng ; Weiss, Mark Allen
• On efficient entreeings
  Amerins, Paul S. ; Baeza-Yates, Ricardo A. ; Wood, Derick
• Decision problems for finite special string-rewriting systems that are confluent on some congruence class
  Otto, Friedrich ; Zhang, Louxin