Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

MCS algorithm

Multilevel Coordinate Search (MCS) is an algorithm for bound constrained global optimization using function values only. To do so, the n-dimensional… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Enumeration of minimal correction sets (MCSes) of conjunctive normal form formulas is a central and highly intractable problem in… Expand
  • table 1
  • figure 1
Is this relevant?
2017
2017
Traditional power flow algorithm such as the trend for front-and-spoke networks and backward substitution method and a cyclic… Expand
  • figure 1
  • table I
  • table VI
  • figure 4
  • table IV
Is this relevant?
2009
2009
  • M. Sarfraz
  • Australasian Conference on Artificial…
  • 2009
  • Corpus ID: 321046
An optimization technique is proposed for the outline capture of planar images. The overall technique has various phases… Expand
Is this relevant?
2009
2009
Agents.- Experimental Market Mechanism Design for Double Auction.- Model Checking Games for a Fair Branching-Time Temporal… Expand
Is this relevant?
2008
2008
Precise measurement of soil hydraulic properties at field scales is one of the prerequisites to simulate subsurface flow and… Expand
  • figure 1
  • table 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
2007
2007
This paper is concerned with the investigation of a novel hybrid LQ-adaptive strategy based on the so called minimal control… Expand
  • figure 1
  • table I
  • figure 2
  • figure 5
  • figure 3
Is this relevant?
2003
2003
In this paper we present a novel approach for mining inexact spatial patterns from multiple images. We propose an inexact maximal… Expand
  • figure 1
  • figure 8
  • figure 4
  • figure 9
  • figure 6
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Inspired by a method by Jones et al. (1993), we present a global optimization algorithm based on multilevel coordinate search. It… Expand
  • figure 1
Is this relevant?
1996
1996
Abstract Let G = ( V , E ) be a finite undirected connected graph. We show that there is a common perfect elimination ordering of… Expand
Is this relevant?