5105 search results - page 393 / 1021 » An algorithm to determine peer-reviewers |
167
click to vote
CORR
2009
Springer
15 years 4 months ago
2009
Springer
The minimal deterministic finite automaton is generally used to determine regular languages equality. Using Brzozowski's notion of derivative, Antimirov and Mosses proposed a...
182
click to vote
AISS
2010
15 years 4 months ago
2010
The vehicle routing problem consists in determining a group of optimal delivery routes that allow satisfaction of the demand from customers spread along a network, which can be re...
175
click to vote
COMPUTING
2010
15 years 4 months ago
2010
We design improved approximation algorithms for two variants of the ADM minimization problem. SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET/WDM rings. T...
202
click to vote
CIAC
2010
Springer
15 years 3 months ago
2010
Springer
We study the parameterized complexity of the problems of determining whether a graph contains a k-edge subgraph (k-vertex induced subgraph) that is a -graph for -graphs being one ...
323
click to vote
APWEB
2011
Springer
15 years 1 months ago
2011
Springer
One difficulty in the design of XML Schema is the restriction that the content models should be deterministic, i. e., the Unique Particle Attribution (UPA) constraint, which means ...