925 search results - page 51 / 185 » Connectivity on Complete Lattices |
STOC
2004
ACM
16 years 4 days ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
111
click to vote
BMCBI
2010
14 years 12 months ago
2010
Background: One of the most challenging aspects of biomolecular systems is the understanding of the coevolution in and among the molecule(s). A complete, theoretical picture of th...
111
click to vote
PERCOM
2007
ACM
15 years 11 months ago
2007
ACM
Traditional mobile ad hoc routing protocols fail to deliver any data in Intermittently Connected Mobile Ad Hoc Networks (ICMN's) because of the absence of complete end-to-end ...
JAIR
2011
2011
Analyzing Search Topology Without Running Any Search: On the Connection Between Causal Graphs and h+
14 years 2 months ago
The ignoring delete lists relaxation is of paramount importance for both satisficing and optimal planning. In earlier work, it was observed that the optimal relaxation heuristic ...
104
click to vote
ORDER
2008
14 years 11 months ago
2008
Orthogonal surfaces are nice mathematical objects which have interesting connections to various fields, e.g., integer programming, monomial ideals and order dimension. While orthog...