895 search results - page 137 / 179 » Using graphs for some discrete tomography problems |
183
click to vote
MOBICOM
2003
ACM
15 years 11 months ago
2003
ACM
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
203
click to vote
ISPAN
2002
IEEE
15 years 11 months ago
2002
IEEE
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
157
click to vote
CSL
2010
Springer
15 years 7 months ago
2010
Springer
We consider two-player games with imperfect information and quantitative objective. The game is played on a weighted graph with a state space partitioned into classes of indistingu...
239
click to vote
CPAIOR
2010
Springer
15 years 4 months ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
154
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
Given concentrations of metabolites over a sequence of time steps, the metabolic pathway prediction problem seeks a set of reactions and rate constants for them that could yield t...