Sciweavers

638 search results - page 84 / 128
» Competitive contagion in networks
Sort
View
ASPDAC
2007
ACM
98views Hardware» more  ASPDAC 2007»
13 years 11 months ago
Fast Analytic Placement using Minimum Cost Flow
Many current integrated circuits designs, such as those released for the ISPD2005[14] placement contest, are extremely large and can contain a great deal of white space. These new...
Ameya R. Agnihotri, Patrick H. Madden
ECML
2006
Springer
13 years 11 months ago
EM Algorithm for Symmetric Causal Independence Models
Causal independence modelling is a well-known method both for reducing the size of probability tables and for explaining the underlying mechanisms in Bayesian networks. In this pap...
Rasa Jurgelenaite, Tom Heskes
HIS
2008
13 years 9 months ago
Solving the Railway Traveling Salesman Problem via a Transformation into the Classical Traveling Salesman Problem
The Railway Traveling Salesman Problem (RTSP) is a practical extension of the classical traveling salesman problem considering a railway network and train schedules. We are given ...
Bin Hu, Günther R. Raidl
WICSA
2008
13 years 9 months ago
Wishes and Boundaries for a Software Architecture Knowledge Community
Software architecting is a highly knowledge-intensive process demanding and producing a large and rich amount of information. To remain competitive, companies and organizations wo...
Patricia Lago, Paris Avgeriou, Rafael Capilla, Phi...
NIPS
2001
13 years 9 months ago
Learning Lateral Interactions for Feature Binding and Sensory Segmentation
We present a new approach to the supervised learning of lateral interactions for the competitive layer model (CLM) dynamic feature binding architecture. The method is based on con...
Heiko Wersing