MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Exploring k." – sorted by Relevance.

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

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

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

ATOM

Exploring the k-colorable Landscape with Iterated Greedy
by Joseph C. Culberson, Feng Luo — 1995 — Dimacs Series in Discrete Mathematics and Theoretical Computer Science
…, EXPLORING THE k-COLORABLE LANDSCAPE WITH ITERATED GREEDY 3 since the greedy algorithm is known to assign…
Cited by 28 (3 self) – Add To MetaCart

Local Classification and Global Estimation: Exploration of the k-nearest neighbor algorithm
by Iris Hendrickx — 2005
…Local Classification and Global Estimation Explorations of the k-nearest neighbor algorithm Thesis…
Cited by 1 (0 self) – Add To MetaCart

Collective Tree Exploration
by Pierre Fraigniaud, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc — 2004 — In: Proc. LATIN 2004. Volume
…Collective tree exploration Pierre Fraigniaud�, Leszek Ga¸sieniec��, Dariusz R. Kowalski…
Cited by 13 (2 self) – Add To MetaCart

Recent Turbulence Model Advances Applied to Multielement Airfoil Computations
by Christopher L. Rumsey, Christopher L. Rumsey, Thomas B. Gatski, Thomas B. Gatski — 2000 — J. Aircraft
… of the two-equation model are explored, and the K-" form is shown to be deficient in the wallbounded regions…
Cited by 7 (4 self) – Add To MetaCart

Estimating the Optimal Number of Alternatives to Be Explored in Large Design Spaces: A Step Towards
by Satyandra K. Gupta — 2002 — Cost in Design Decision Models. ASME 2002 DETC CIE
… or by contacting Dr. S.K. Gupta (skgupta@(email omitted);). ESTIMATING THE OPTIMAL NUMBER OF ALTERNATIVES TO BE EXPLORED…
Cited by 1 (0 self) – Add To MetaCart

C.: Smart robot teams exploring sparse trees
by M. Dynia, F. Meyer Auf Der Heide, C. Schindelhauer — 2006 — In: Proc. of the 31st International Symposium on Mathematical Foundations of Computer Science (MFCS 2006
… consider a tree which has to be completely explored by a group of k robots, initially placed at the root…
Cited by 1 (1 self) – Add To MetaCart

On k-wise independent distributions and Boolean functions
by Itai Benjamini, Ori Gurel-gurevich, Ron Peled
…, we explore the extremal properties of k-wise independent distributions and provide ways…
Cited by 2 (0 self) – Add To MetaCart

Computational and Inferential Difficulties With Mixture Posterior Distributions
by Gilles Celeux, Merrilee Hurn, Christian P. Robert — 1999 — Journal of the American Statistical Association
…. Monitoring of the Markov chain Monte Carlo sample usually shows that it does not explore the k! equivalent…
Cited by 61 (8 self) – Add To MetaCart

Unsupervised Multi-Agent Exploration of Structured Environments
by Dario Maio, Stefano Rizzi, Viale Risorgimento — 1995 — In Proceedings of the First International Conference on Multi-Agent Systems (ICMAS-95
…) is proportional to r, and is function of k and w. It is thus possible to define a w- optimal exploration profile…
Cited by 9 (1 self) – Add To MetaCart

Hexagonal Grid Polygons Online
by Daniel Herrmann, Tom Kamphans, Elmar Langetepe — 2007
… of unvisited cells. In this case it is reasonable to explore the component K2 first, because the start cell…
Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

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