836 search results - page 131 / 168 » On the Complexity of Train Assignment Problems |
174
click to vote
NIPS
2001
15 years 5 months ago
2001
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Neares...
131
click to vote
BMCBI
2008
15 years 4 months ago
2008
Background: Prediction of disulfide bridges from protein sequences is useful for characterizing structural and functional properties of proteins. Several methods based on differen...
131
click to vote
GLOBECOM
2008
IEEE
15 years 10 months ago
2008
IEEE
—In this paper, we address the problem of establishing full connectivity and satisfying required traffic capacity between disconnected clusters in large wireless ad-hoc ground n...
125
click to vote
SIROCCO
2010
15 years 5 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
159
click to vote
INFORMS
1998
15 years 3 months ago
1998
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...