Sciweavers

396 search results - page 60 / 80
» Community Structure in Large Complex Networks
Sort
View
ASMTA
2008
Springer
167views Mathematics» more  ASMTA 2008»
13 years 10 months ago
Perfect Simulation of Stochastic Automata Networks
The solution of continuous and discrete-time Markovian models is still challenging mainly when we model large complex systems, for example, to obtain performance indexes of paralle...
Paulo Fernandes, Jean-Marc Vincent, Thais Webber
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
14 years 9 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
CP
1998
Springer
14 years 28 days ago
Modelling CSP Solution Algorithms with Petri Decision Nets
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
Stephan Pontow
BMCBI
2010
183views more  BMCBI 2010»
13 years 8 months ago
SING: Subgraph search In Non-homogeneous Graphs
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
Raffaele Di Natale, Alfredo Ferro, Rosalba Giugno,...
P2P
2005
IEEE
189views Communications» more  P2P 2005»
14 years 2 months ago
Proximity Neighbor Selection for a DHT in Wireless Multi-Hop Networks
A mobile ad hoc network (MANET) is a multi-hop wireless network having no infrastructure. Thus, the mobile nodes have to perform basic control tasks, such as routing, and higher-l...
Curt Cramer, Thomas Fuhrmann