Sciweavers

1963 search results - page 130 / 393
» The Maximum Solution Problem on Graphs
Sort
View
SIROCCO
2008
13 years 11 months ago
Centralized Communication in Radio Networks with Strong Interference
We study communication in known topology radio networks with the presence of interference constraints. We consider a real-world situation, when a transmission of a node produces an...
Frantisek Galcík
EDBTW
2010
Springer
14 years 4 months ago
Biochemical network matching and composition
Graph composition has applications in a variety of practical applications. In drug development, for instance, in order to understand possible drug interactions, one has to merge k...
Martin Hugh Goodfellow, John Wilson, Ela Hunt
IPCO
2007
94views Optimization» more  IPCO 2007»
13 years 11 months ago
Infrastructure Leasing Problems
Consider the following Steiner Tree leasing problem. Given a graph G = (V, E) with root r, and a sequence of terminal sets Dt ⊆ V for each day t ∈ [T]. A feasible solution to t...
Barbara M. Anthony, Anupam Gupta
TALG
2008
97views more  TALG 2008»
13 years 10 months ago
On an infinite family of solvable Hanoi graphs
The Tower of Hanoi problem is generalized by placing pegs on the vertices of a given directed graph G with two distinguished vertices, S and D, and allowing moves only along arcs o...
Dany Azriel, Noam Solomon, Shay Solomon
FLAIRS
2003
13 years 11 months ago
A Graph Based Synthesis Algorithm for Solving CSPs
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to a set of constraints. While solving a CSP is an ...
Wanlin Pang, Scott D. Goodwin