1404 search results - page 117 / 281 » Optimization problems in multiple-interval graphs |
191
click to vote
SODA
1998
ACM
15 years 7 months ago
1998
ACM
Given a planar graph on n nodes with costs weights on its edges, de ne the distance between nodes i and j as the length of the shortest path between i and j. Consider this as an i...
184
click to vote
GECCO
2005
Springer
15 years 12 months ago
2005
Springer
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
161
click to vote
ISCC
2008
IEEE
16 years 22 days ago
2008
IEEE
We propose efficient scheduling algorithms for downlink MIMO-CDMA systems using zero forcing beamforming to achieve high system throughput with low computational complexity. Base...
167
click to vote
UAI
2003
15 years 7 months ago
2003
We analyze a new property of directed acyclic graphs (DAGs), called layerwidth, arising from a class of DAGs proposed by Eiter and Lukasiewicz. This class of DAGs permits certain ...
129
click to vote
IJCAI
2001
15 years 7 months ago
2001
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...