نتایج جستجو برای: الگوریتم تطبیقی hill climbing

تعداد نتایج: 65725  

1992
Akhil Madhani Steven Dubowsky

Multi-limb, mobile robotic systems will need to apply large forces over large ranges of motion. This paper presents the Force-Workspace Approach which can be used to plan the activities of such systems allowing them to execute such tasks without violating actuation limits, frictional constraints with their environments, and joint range of motion limits. The technique is applied to a robotic cli...

Journal: :J. Field Robotics 1997
Brian Yamauchi Pat Langley

We have developed a technique for place learning and place recognition in dynamic environments. Our technique associates evidence grids with places in the world and uses hill climbing to find the best alignment between current perceptions and learned evidence grids. We present results from five experiments performed using a real mobile robot in a real-world environment. These experiments measur...

2002
Wei-Min Shen Behnam Salemi

Task reallocation in a multi-robot organization is a process that distributes a decomposed global task to individual robots. This process must be distributed and dynamic because it relies on critical information that can only be obtained during mission execution. This paper presents a representation for this challenging problem and proposes an algorithm that allows member robots to trade tasks ...

2008
Simon Colton

We investigate the automatic construction of visual scenes via a hybrid evolutionary/hill-climbing approach using a correlationbased fitness function. This forms part of The Painting Fool system, an automated artist which is able to render the scenes using simulated art materials. We further describe a novel method for inventing fitness functions using the HR descriptive machine learning system...

2007
Paul F. Evangelista Mark J. Embrechts Boleslaw K. Szymanski

This paper proposes a novel approach for directly tuning the gaussian kernel matrix for one class learning. The popular gaussian kernel includes a free parameter, σ, that requires tuning typically performed through validation. The value of this parameter impacts model performance significantly. This paper explores an automated method for tuning this kernel based upon a hill climbing optimizatio...

2014
John Ross Wallrabenstein Chris Clifton

• Sellers distribute goods • Buyers purchase some quantity Tâtonnement mechanism • A " Hill Climbing " approach Utility Functions • Describe a player's preferences • Specify a quantity for all prices Protocol • Sellers set the initial price • Buyers pledge quantity at price • Equilibrium sets the final price Real World Market Applications • Tokyo Grain Exchange (itayose) Debate on Applicability...

1988
Sybille Hellebrand Hans-Joachim Wunderlich

Die Kosten für die Testvorbereitung, Testerzeugung und Testdurchführung wachsen überproportional mit der Komplexität anwendungsspezifischer Schaltungen, und die Teststrategie sollte daher bereits in einer sehr frühen Phase des Schaltungsentwurfs festgelegt und berücksichtig werden. In diesem Artikel werden logische Grundzellen und Algorithmen zur Unterstützung des pseudo-erschöpfenden Tests vor...

2004
Taekyoung Kwon Jaeil Lee

It is desirable to generate a digital signature using biometrics but not practicable because of its inaccurate measuring and potential hill-climbing attacks, without using specific hardware devices that hold signature keys or biometric templates securely. We study a simple practical method for biometrics based digital signature generation without such restriction, by exploiting the existing too...

2004
Barry Schiffman Kathleen McKeown

Our system for the Novelty Track at TREC 2004 looks beyond sentence boundaries as well as within sentences to identify novel, nonduplicative passages. It tries to identify text spans of two or more sentences that encompass mini-segments of new information. At the same time, we avoid any pairwise comparison of sentences, but rely on the presence of previously unseen terms to provide evidence of ...

1997
Bernhard Pfahringer

We deene a formula for estimating the coding costs of decision lists for propositional domains. This formula allows for multiple classes and both categorical and numerical attributes. For artiicial domains the formula performs quite satisfactory, whereas results are rather mixed and inconclusive for natural domains. Further experiments lead to a principled simpliication of the original formula ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید