Sciweavers

5473 search results - page 887 / 1095
» On the graph isomorphism problem
Sort
View
CORR
2010
Springer
126views Education» more  CORR 2010»
15 years 6 months ago
Towards Providing Low-Risk and Economically Feasible Network Data Transfer Services
: - In the first part of this paper we present the first steps towards providing low-risk and economically feasible network data transfer services. We introduce three types of data...
Mugurel Ionut Andreica, Vasile Deac, Stelian Tipa
CORR
2010
Springer
101views Education» more  CORR 2010»
15 years 6 months ago
Distributed anonymous discrete function computation
We propose a model for deterministic distributed function computation by a network of identical and anonymous nodes. In this model, each node has bounded computation and storage c...
Julien M. Hendrickx, Alexander Olshevsky, John N. ...
CSDA
2010
118views more  CSDA 2010»
15 years 6 months ago
Grapham: Graphical models with adaptive random walk Metropolis algorithms
Recently developed adaptive Markov chain Monte Carlo (MCMC) methods have been applied successfully to many problems in Bayesian statistics. Grapham is a new open source implementat...
Matti Vihola
FMSD
2008
94views more  FMSD 2008»
15 years 6 months ago
Optimal infinite scheduling for multi-priced timed automata
Abstract. This paper is concerned with the derivation of infinite schedules for timed automata that are in some sense optimal. To cover a wide class of optimality criteria we start...
Patricia Bouyer, Ed Brinksma, Kim Guldstrand Larse...
CC
2006
Springer
133views System Software» more  CC 2006»
15 years 6 months ago
The complexity of chromatic strength and chromatic edge strength
The sum of a coloring is the sum of the colors assigned to the vertices (assuming that the colors are positive integers). The sum (G) of graph G is the smallest sum that can be ach...
Dániel Marx