1277 search results - page 4 / 256 » Terminating Decision Algorithms Optimally |
MP
2006
14 years 9 months ago
2006
Given an undirected graph G = (V;E) and three speci ed terminal nodes t1;t2;t3, a 3-cut is a subset A of E such that no two terminals are in the same component of GnA. If a non-neg...
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
JSS
1998
14 years 9 months ago
1998
An important problem in the ®eld of distributed systems is that of detecting the termination of a distributed computation. Distributed termination detection (DTD) is a dicult p...
WRLA
2010
14 years 7 months ago
2010
Abstract. If a set of equations E∪Ax is such that E is confluent, terminating, and coherent modulo Ax, narrowing with E modulo Ax provides a complete E∪Ax-unification algorit...
INFOCOM
2007
IEEE
15 years 3 months ago
2007
IEEE
— Traditional Physical Carrier Sensing (PCS), which aims at eliminating hidden terminals in wireless networks, causes too many exposed terminals and deteriorates the throughput p...