Sciweavers

559 search results - page 69 / 112
» Augmented Marked Graphs
Sort
View
CP
2005
Springer
14 years 13 hour ago
Using Boolean Constraint Propagation for Sub-clauses Deduction
Boolean Constraint Propagation (BCP) is recognized as one of the most useful technique for efficient satisfiability checking. In this paper a new extension of the scope of boole...
Sylvain Darras, Gilles Dequen, Laure Devendeville,...
SAMOS
2010
Springer
13 years 8 months ago
Programming multi-core architectures using Data-Flow techniques
Abstract—In this paper we present a Multithreaded programming methodology for multi-core systems that utilizes DataFlow concurrency. The programmer augments the program with macr...
Samer Arandi, Paraskevas Evripidou
SEMWEB
2010
Springer
13 years 8 months ago
SPARQL Query Optimization on Top of DHTs
We study the problem of SPARQL query optimization on top of distributed hash tables. Existing works on SPARQL query processing in such environments have never been implemented in a...
Zoi Kaoudi, Kostis Kyzirakos, Manolis Koubarakis

Publication
167views
13 years 10 months ago
A Network Coding Approach to IP Traceback
Traceback schemes aim at identifying the source(s) of a sequence of packets and the nodes these packets traversed. This is useful for tracing the sources of high volume traffic, e...
Pegah Sattari, Minas Gjoka, Athina Markopoulou
STOC
2003
ACM
114views Algorithms» more  STOC 2003»
14 years 10 months ago
Testing subgraphs in directed graphs
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
Noga Alon, Asaf Shapira