2612 search results - page 282 / 523 » Switching Graphs and Their Complexity |
119
click to vote
ECOOP
2006
Springer
15 years 8 months ago
2006
Springer
Object-oriented programs often require large heaps to run properly or meet performance goals. They use high-overhead collections, bulky data models, and large caches. Discovering t...
142
Voted
ISCAPDCS
2007
15 years 6 months ago
2007
We address distributed real-time applications represented by systems of non-preemptive dependent periodic tasks. This system is described by an acyclic directed graph. Because the...
153
click to vote
UAI
2004
15 years 6 months ago
2004
Generalized belief propagation (GBP) has proven to be a promising technique for approximate inference tasks in AI and machine learning. However, the choice of a good set of cluste...
128
click to vote
GECCO
2008
Springer
15 years 6 months ago
2008
Springer
We propose a network characterization of combinatorial fitness landscapes by adapting the notion of inherent networks proposed for energy surfaces [5]. We use the well-known fami...
143
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Given a directed acyclic graph with labeled vertices, we consider the problem of finding the most common label sequences ("traces") among all paths in the graph (of some...