336 search results - page 3 / 68 » Approximating Transitivity in Directed Networks |
CP
2004
Springer
13 years 11 months ago
2004
Springer
We study the quality of LP-based approximation methods for pure combinatorial problems. We found that the quality of the LPrelaxation is a direct function of the underlying constra...
AMCS
2008
13 years 5 months ago
2008
The objective of the article is to obtain general conditions for several types of controllability at once for an abstract differential equation of arbitrary order, instead of condi...
IEAAIE
2010
Springer
13 years 3 months ago
2010
Springer
This work deals with an original problem with regard to the traditionally sequential planning process in public transit networks. This problem aims at modifying the network's ...
FSMNLP
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We present a formalization of lexicalized Recursive Transition Networks which we call Automaton-Based Generative Dependency Grammar (gdg). We show how to extract a gdg fr...
GLOBECOM
2008
IEEE
14 years 1 days ago
2008
IEEE
—Consider a wireless multi-hop network formed by distributing a total of n nodes randomly and uniformly in the unit cube [0, 1]d (d = 1, 2, 3) and connecting any two distinct nod...