Sciweavers

228 search results - page 10 / 46
» Two Normal Forms for Rewriting P Systems
Sort
View
RTA
1995
Springer
13 years 11 months ago
Prototyping Completion with Constraints Using Computational Systems
We use computational systems to express a completion with constraints procedure that gives priority to simplifications. Computational systems are rewrite theories enriched by stra...
Hélène Kirchner, Pierre-Etienne More...
ICDCS
2009
IEEE
14 years 4 months ago
ISP Friend or Foe? Making P2P Live Streaming ISP-Aware
Abstract: Current peer-to-peer systems are network-agnostic, often generating large volumes of unnecessary inter-ISP traffic. Although recent work has shown the benefits of ISP-a...
Fabio Picconi, Laurent Massoulié
ICDE
2006
IEEE
119views Database» more  ICDE 2006»
14 years 8 months ago
Laws for Rewriting Queries Containing Division Operators
Relational division, also known as small divide, is a derived operator of the relational algebra that realizes a many-to-one set containment test, where a set is represented as a ...
Ralf Rantzau, Christoph Mangold
BDA
2007
13 years 8 months ago
Query Rewriting Based on User's Profile Knowledge
Query personalization was introduced as an advanced mechanism to allow the reformulation of database queries and adapt them to the user's domain of interest and preferences. ...
Dimitre Kostadinov, Mokrane Bouzeghoub, Sté...
JUCS
2007
122views more  JUCS 2007»
13 years 7 months ago
Spiking Neural P Systems with Astrocyte-Like Control
: Spiking neural P systems are computing models inspired from the way the neurons communicate by means of spikes, electrical impulses of identical shapes. In this note we consider ...
Gheorghe Paun