1653 search results - page 131 / 331 » Directed tree-width examples |
103
click to vote
JCO
2006
15 years 1 months ago
2006
The relative worst order ratio is a measure for the quality of online algorithms. Unlike the competitive ratio, it compares algorithms directly without involving an optimal offline...
91
Voted
ENTCS
2007
15 years 1 months ago
2007
Queueing network formalisms are very good at describing the spatial movement of customers, but typically poor at describing how customers change as they move through the network. ...
JSC
2006
15 years 1 months ago
2006
For a polynomial ring R = k[x1, ..., xn], we present a method to compute the characteristic cycle of the localization Rf for any nonzero polynomial f R that avoids a direct comput...
92
Voted
JUCS
2006
15 years 1 months ago
2006
: Emerging interaction paradigms, such as service-oriented computing, and new technological challenges, such as exogenous component coordination, suggest new roles and application ...
84
Voted
EOR
2007
15 years 1 months ago
2007
A multiple objective programming approach for the analytic network process (ANP) is proposed to obtain all local priorities for crisp or interval judgments at one time, even in an...