Sciweavers

419 search results - page 39 / 84
» Constraint models for graceful graphs
Sort
View
STOC
2010
ACM
220views Algorithms» more  STOC 2010»
14 years 2 months ago
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
Mohsen Bayati, David Gamarnik, Prasad Tetali
ATMOS
2007
119views Optimization» more  ATMOS 2007»
14 years 13 days ago
Models for Railway Track Allocation
The optimal track allocation problem (OPTRA) is to find, in a given railway network, a conflict free set of train routes of maximum value. We study two types of integer programmi...
Ralf Borndörfer, Thomas Schlechte
ICSM
2003
IEEE
14 years 4 months ago
Software Architecture Recovery based on Pattern Matching
This paper is a summary of the author’s thesis that presents a model and an environment for recovering the high level design of legacy software systems based on user defined ar...
Kamran Sartipi
GLOBECOM
2006
IEEE
14 years 5 months ago
Content Delivery in Overlay Networks: a Stochastic Graph Processes Perspective
— We consider the problem of distributing a content of finite size to a group of users connected through an overlay network that is built by a peer-to-peer application. The goal...
Damiano Carra, Renato Lo Cigno, Ernst W. Biersack
SOSYM
2010
107views more  SOSYM 2010»
13 years 9 months ago
A UML/OCL framework for the analysis of graph transformation rules
In this paper we present an approach for the analysis of graph transformation rules based on an intermediate OCL representation. We translate different rule semantics into OCL, to...
Jordi Cabot, Robert Clarisó, Esther Guerra,...