16404 search results - page 820 / 3281 » A set coverage problem |
208
click to vote
WAOA
2004
Springer
16 years 28 days ago
2004
Springer
SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET /WDM rings. The number of SONET ADMs required by a set of traffic streams is determined by the routing and...
202
click to vote
COCOON
2003
Springer
16 years 24 days ago
2003
Springer
We study the complexity of the reachability problem for a new subclass of Petri nets called simple-circuit Petri nets, which properly contains several well known subclasses such as...
207
click to vote
ICDT
2003
ACM
16 years 24 days ago
2003
ACM
XPath is a simple language for navigating an XML tree and returning a set of answer nodes. The focus in this paper is on the complexity of the containment problem for various fragm...
222
click to vote
SWAT
2010
Springer
16 years 19 days ago
2010
Springer
Inspired by air traffic control and other applications where moving objects have to be labeled, we consider the following (static) point labeling problem: given a set P of n points...
207
click to vote
GECCO
2009
Springer
16 years 6 days ago
2009
Springer
In this paper, we present a stigmergy-based algorithm for solving optimization problems with continuous variables, labeled Differential Ant-Stigmergy Algorithm (DASA). The perfor...