7380 search results - page 378 / 1476 » time 2008 |
157
click to vote
IPL
2007
15 years 6 months ago
2007
Dynamic networks are characterized by transit times on edges. Dynamic flow problems consider transshipment problems in dynamic networks. We introduce a new version of dynamic fl...
164
click to vote
IPL
2007
15 years 6 months ago
2007
We consider the problem Monet—given two monotone formulas ϕ in DNF and ψ in CNF, decide whether they are equivalent. While Monet is probably not coNPhard, it is a long standin...
153
click to vote
IPL
2007
15 years 6 months ago
2007
In this work we consider hierarchical clustering algorithms, such as UPGMA, which follow the closest-pair joining scheme. We survey optimal O(n2)-time implementations of such algo...
162
click to vote
TEC
2008
15 years 6 months ago
2008
Abstract--In previous research, we have designed and successfully tested a Traffic Light Cycles Evolutionary Optimization Architecture. In this paper, we attempt to validate those ...
207
click to vote
TON
2008
15 years 6 months ago
2008
We consider a multi-hop wireless network shared by many users. For an interference model that constrains a node to either transmit to or receive from only one other node at a time,...