# US 2010/0169374 A1 · Adaptive Parameterized Search Algorithm

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2010/0169374 A1
- Document ID: US20100169374A1
- Status: Published application
- Kind: A1
- Application number: 12/344,244
- Filed: 2008-12-25
- Published: 2010-07-01
- Earliest claimed: 2008-12-25
- Assignees: Avaya Inc.
- Inventors: Bengi Karacali-Akyamac; Mark John Karol; Parameshwaran Krishnan
- Web page: https://patentgrep.com/patent/US20100169374A1

## CPC

- G06F 16/24542: {Plan optimisation}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A method is disclosed for conducting a search in which measurements of a time-varying property are made and updated during the search, and in which the measurements might be uncertain. In accordance with the illustrative embodiment, one or more search algorithm parameters (e.g., the maximum branching factor of a search tree, a depth cutoff for a search tree, a time cutoff, a threshold, etc.) are adjusted dynamically during the search based on at least one of: the degree of uncertainty of the measurements, the variability of measurements over time (e.g., standard deviation, etc.), and the fraction of members whose measurement is better than a threshold. In addition, the illustrative embodiment enables the search space to be pruned based on these criteria.

## Claims

### Claim 1

A method comprising:
performing a search in accordance with a search algorithm, wherein said search is for finding a member of a search space that has a good, or ideally the best, measurement of a time-varying property, and wherein measurements of said time-varying property are subject to uncertainty; and
setting the value of a parameter of said search algorithm based on the degree of uncertainty of the measurements.

### Claim 2 (depends on 1)

The method of claim 1 further comprising changing the value of said parameter during said search in response to a change in the degree of uncertainty of the measurements.

### Claim 3 (depends on 1)

The method of claim 1 further comprising pruning said search space based on the degree of uncertainty of the measurements.

### Claim 4 (depends on 1)

The method of claim 1 wherein said parameter is a depth cutoff for a search tree.

### Claim 5 (depends on 1)

The method of claim 1 wherein said parameter affects how long said search is performed.

### Claim 6 (depends on 1)

The method of claim 1 wherein the setting of the value of said parameter is also based on the variability of measurements for one or more members of said search space.

### Claim 7 (depends on 1)

The method of claim 1 wherein the setting of the value of said parameter is also based on what fraction of a plurality of members of said search space has a measurement of said time-varying property that is better than a threshold.

### Claim 8

A method comprising:
performing a search in accordance with a search algorithm, wherein said search is for finding a member of a search space that has a good, or ideally the best, measurement of a time-varying property; and
setting the value of a parameter of said search algorithm based on the variability of measurements for one or more members of said search space.

### Claim 9 (depends on 8)

The method of claim 8 wherein the variability of measurements is expressed as standard deviation.

### Claim 10 (depends on 8)

The method of claim 8 further comprising changing the value of said parameter during said search in response to a change in the variability of measurements.

### Claim 11 (depends on 8)

The method of claim 8 further comprising pruning said search space based on the variability of measurements for one or more members of said search space.

### Claim 12 (depends on 8)

The method of claim 8 wherein said parameter is a maximum branching factor of a search tree.

### Claim 13 (depends on 8)

The method of claim 8 wherein said parameter affects how long said search is performed.

### Claim 14 (depends on 8)

The method of claim 8 wherein the setting of the value of said parameter is also based on what fraction of a plurality of members of said search space has a measurement of said time-varying property that is better than a threshold.

### Claim 15

A method comprising:
performing a search in accordance with a search algorithm, wherein said search is for finding a member of a search space that has a good, or ideally the best, measurement of a time-varying property; and
setting the value of a parameter of said search algorithm based on what fraction f of a plurality of members of said search space has a measurement of said time-varying property that is better than a threshold.

### Claim 16 (depends on 15)

The method of claim 15 further comprising changing the value of said parameter during said search in response to a change in said fraction f.

### Claim 17 (depends on 15)

The method of claim 15 further comprising pruning said search space based on said fraction f.

### Claim 18 (depends on 15)

The method of claim 15 wherein said parameter affects how long said search is performed.

### Claim 19 (depends on 15)

The method of claim 15 wherein said plurality of members of said search space comprises members that are visited by said search.

### Claim 20 (depends on 15)

The method of claim 15 wherein said plurality of members of said search space is all of the members of said search space.