Searching for "Neighbor Designs." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

83 documents found, showing 1 through 10. Next 10 →

Localized Broadcasting in Mobile Ad Hoc Networks Using Neighbor Designation
by Wei Lou, Jie Wu — 2005 — In Handbook of Mobile Computing
…Localized Broadcasting in Mobile Ad Hoc Networks Using Neighbor Designation Wei Lou and Jie Wu…
Cited by 7 (0 self) – Add To MetaCart

Using a Genetic Algorithm for Editing k-Nearest Neighbor Classifiers
by R. Gil-pita, X. Yao
… improvements of the edited k-nearest neighbor design using genetic algorithms: the use of a mean square error…
Add To MetaCart

A Generic Broadcast Protocol in Ad Hoc Networks Based on Self-Pruning
by Jie Wu , Fei Dai
… forward node set without excessive overhead. Neighbor-knowledgebased methods, including neighbor-designating…
Add To MetaCart

Nearest Neighbor Methods
by Philip M. Dixon — 2001
… designs for field experiments, in which each pair of treatments occurs as neighbors equally frequently. I…
Add To MetaCart

Optimal Design via Curve Fitting of Monte Carlo Experiments
by Peter Müller, Peter Muller, Giovanni Parmigiani, Giovanni Parmigiani, Assistant Professors — 1996
… neighboring design points. The central idea is that of implementing stochastic optimization by curve fitting…
Cited by 15 (4 self) – Add To MetaCart

Interlocking control by Distributed Signal Boxes: design and verification with the SPIN model
by Stylianos Basagiannis, Panagiotis Katsaros, Andrew Pombortsis — 2006 — Proceedings of the International Symposium on Parallel and Distributed Processing and Applications (ISPA 2006), Lecture Notes in Computer Science 4330
…Interlocking control by Distributed Signal Boxes: design and verification with the SPIN model…
Cited by 1 (1 self) – Add To MetaCart

Jump Detection In Regression Surfaces
by Brian Yandell, Peihua Qiu, Peihua Qiu, Brian Y — 1994 — Journal of Computational and Graphical Statistics
…;j) 1 ; fi (i;j) 2 ), two neighboring design points (x N1 ; y N1 ) and (x N2 ; y N2 ) are determined…
Cited by 7 (7 self) – Add To MetaCart

Toward broadcast reliability in mobile ad hoc networks with double coverage
by Wei Lou, Jie Wu — 2007 — IEEE Trans. on Mobile Computing
…(V ) is the union of the neighbor sets of every node in V , that is, N(V ) = ∪∀w∈V N(w). 2.1 Neighbor-Designating…
Cited by 1 (0 self) – Add To MetaCart

Improving Route Discovery in On-Demand Routing Protocols Using Two-Hop Connected Dominating Sets
by Marco Aurelio Spohn — 2005
… the first neighbor-designated algorithm for computing a TCDS. The one-hop neighbor list and the one…
Cited by 1 (1 self) – Add To MetaCart

Broadcasting in wireless multihop networks with the dynamic forwarding delay concept
by Marc Heissenbüttel, Torsten Braun, Markus Wälchli, Thomas Bernoulli — 2004
… . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.1.4 Neighbor-designated approaches . . . . . . . . . . . . . . . . . . . . . . . 6 2.1.5 Self…
Cited by 1 (0 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB