Search Sciweavers | Sciweavers

5606 search results - page 24 / 1122

» Randomization Techniques for Graphs.

click to vote

CONSTRAINTS
1998

127views more CONSTRAINTS 1998»

Experimental Analysis of Numeric and Symbolic Constraint Satisfaction Techniques for Temporal Reasoning

13 years 7 months ago

Download www.loria.fr

Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...

Malek Mouhoub, François Charpillet, Jean Pa...

claim paper

Read More »

click to vote

CONCUR
2001
Springer

96views Distributed And Parallel Com...» more CONCUR 2001»

A Static Analysis Technique for Graph Transformation Systems

14 years 12 days ago

Download www.fmi.uni-stuttgart.de

In this paper we introduce a static analysis technique for graph transformation systems. We present an algorithm which, given a graph transformation system and a start graph, produ...

Paolo Baldan, Andrea Corradini, Barbara König

claim paper

Read More »

click to vote

PODC
2009
ACM

185views Distributed and Parallel Com...» more PODC 2009»

Fast distributed random walks

14 years 8 months ago

Download www.cs.purdue.edu

Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...

Atish Das Sarma, Danupon Nanongkai, Gopal Panduran...

claim paper

Read More »

click to vote

RSA
2006

132views more RSA 2006»

Almost universal graphs

13 years 7 months ago

Download www.math.cmu.edu

We study the question as to when a random graph with n vertices and m edges contains a copy of almost all graphs with n vertices and cn/2 edges, c

Alan M. Frieze, Michael Krivelevich

claim paper