Abstract: Methods, systems, and media for presenting search results are provided. In accordance with some embodiments, the method comprises: receiving text corresponding to a search query; determining whether a content rating score associated with the search query is below a predetermined threshold, wherein the score is calculated by: identifying a first plurality of search results retrieved using the search query, wherein each search result is associated with one of a plurality of content ratings classes; and calculating the content rating score that is a proportion of search results associated with at least one of the content ratings classes among the first plurality of search results; in response to determining that the content rating score is below the predetermined threshold, identifying a second plurality of search results to be presented based on the search query; and causing the second plurality of search results to be presented.

Abstract: Methods, systems, and media for presenting search results are provided. In accordance with some embodiments, the method comprises: receiving text corresponding to a search query; determining whether a content rating score associated with the search query is below a predetermined threshold, wherein the score is calculated by: identifying a first plurality of search results retrieved using the search query, wherein each search result is associated with one of a plurality of content ratings classes; and calculating the content rating score that is a proportion of search results associated with at least one of the content ratings classes among the first plurality of search results; in response to determining that the content rating score is below the predetermined threshold, identifying a second plurality of search results to be presented based on the search query; and causing the second plurality of search results to be presented.

Abstract: A method for selectively modifying scores of youth-oriented content search results is disclosed. The method includes identifying a plurality of search results, with each search result being associated with one of a plurality of scores. The method further includes selecting a subset of search results from the plurality of search results, and selecting a subset of scores within the plurality of scores that includes scores associated with the selected subset of search results. The method further includes modifying each score of the subset of scores with a query-dependent factor.

Abstract: Methods, systems, and media for presenting search results are provided. In accordance with some embodiments, the method comprises: receiving text corresponding to a search query; determining whether a content rating score associated with the search query is below a predetermined threshold, wherein the score is calculated by: identifying a first plurality of search results retrieved using the search query, wherein each search result is associated with one of a plurality of content ratings classes; and calculating the content rating score that is a proportion of search results associated with at least one of the content ratings classes among the first plurality of search results; in response to determining that the content rating score is below the predetermined threshold, identifying a second plurality of search results to be presented based on the search query; and causing the second plurality of search results to be presented.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for ranking search results. One of the methods includes receiving a search result obtained in response to a query, wherein the search result identifies a resource and has an associated score S. A determination is made that users prefer newer resources over older resources for the query and that the resource is a new resource. A new score S? is associated with the resource in place of S, based on the determination that users prefer newer resources over older resources for the query and that the resource is a new resource.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for processing video searches using query-independent quality scores.

Abstract: Disclosed is a method, system, and computer program product for routing, modeling routes, and measuring congestion. In some embodiments, Gcells are implemented with reduced number of nodes to facilitate route modeling and congestion measurement. Some embodiments are particularly suitable for direct congestion and routing analysis of diagonal routing paths. In this way, congestion analysis can be directly performed along diagonal boundaries for diagonal routes, without requiring association with Gcell boundaries on Manhattan routing layers.

Abstract: Disclosed is a method, system, and computer program product for routing, modeling routes, and measuring congestion. In some embodiments, Gcells are implemented with reduced number of nodes to facilitate route modeling and congestion measurement. Some embodiments are particularly suitable for direct congestion and routing analysis of diagonal routing paths. In this way, congestion analysis can be directly performed along diagonal boundaries for diagonal routes, without requiring association with Gcell boundaries on Manhattan routing layers.

Abstract: Some embodiments of the invention provide a method of routing. The method selects a net with a set of routable elements in a multi-layer layout region. In some embodiments, the method identifies a route for the net based on different congestion goals on different layers. In other embodiments, the method identifies a route for the net based on different congestion goals between different layer pairs. In some embodiments, the method identifies a route for the net based on both the different congestion goals on different layers and between different layer pairs.

Abstract: Some embodiments of the invention provide a method for defining wiring directions in a design layout having several wiring layers. The method decomposes a first wiring layer into several non-overlapping regions. It assigns at least two different local preferred wiring directions to at least two of the regions. In some embodiments, the method decomposing the first wiring layer by using the vertices of items in the layout to decompose the layout. In some of these embodiments, the items include macro blocks. The method of some embodiments also identifies several power via arrays on the first wiring layer, and identifies a local preferred wiring direction based on the arrangement of the power via arrays on the first wiring layer.

Abstract: Some embodiments of the invention provide a method for defining wiring directions in a design layout having several wiring layers. The method decomposes a first wiring layer into several non-overlapping regions. It assigns at least two different local preferred wiring directions to at least two of the regions. In some embodiments, the method decomposing the first wiring layer by using the vertices of items in the layout to decompose the layout. In some of these embodiments, the items include macro blocks. The method of some embodiments also identifies several power via arrays on the first wiring layer, and identifies a local preferred wiring direction based on the arrangement of the power via arrays on the first wiring layer.

Abstract: Some embodiments of the invention provide a method for defining wiring directions in a design layout having several wiring layers. The method decomposes a first wiring layer into several non-overlapping regions. It assigns at least two different local preferred wiring directions to at least two of the regions. In some embodiment, the method decomposing the first wiring layer by using the vertices of items in the layout to decompose the layout. In some of these embodiments, the item include macro blocks. The method of some embodiments also identifies several power via arrays on the first wiring layer, and identifies a local preferred wiring direction based on the arrangement of the power via arrays on the first wiring layer.

Abstract: Disclosed is a method, system, and computer program product for routing, modeling routes, and measuring congestion. In some embodiments, Gcells are implemented with reduced number of nodes to facilitate route modeling and congestion measurement. Some embodiments are particularly suitable for direct congestion and routing analysis of diagonal routing paths. In this way, congestion analysis can be directly performed along diagonal boundaries for diagonal routes, without requiring association with Gcell boundaries on Manhattan routing layers.

Abstract: Disclosed is a method, system, and computer program product for routing, modeling routes, and measuring congestion. In some embodiments, Gcells are implemented with reduced number of nodes to facilitate route modeling and congestion measurement. Some embodiments are particularly suitable for direct congestion and routing analysis of diagonal routing paths. In this way, congestion analysis can be directly performed along diagonal boundaries for diagonal routes, without requiring association with Gcell boundaries on Manhattan routing layers.

Abstract: Disclosed is a method, system, and computer program product for routing, modeling routes, and measuring congestion. In some embodiments, Gcells are implemented with reduced number of nodes to facilitate route modeling and congestion measurement. Some embodiments are particularly suitable for direct congestion and routing analysis of diagonal routing paths. In this way, congestion analysis can be directly performed along diagonal boundaries for diagonal routes, without requiring association with Gcell boundaries on Manhattan routing layers.

Abstract: Some embodiments of the invention provide a method of routing. The method selects a net with a set of routable elements in a multi-layer layout region. In some embodiments, the method identifies a route for the net based on different congestion goals on different layers. In other embodiments, the method identifies a route for the net based on different congestion goals between different layer pairs. In some embodiments, the method identifies a route for the net based on both the different congestion goals on different layers and between different layer pairs.

Abstract: Some embodiments of the invention provide a method of routing. The method selects a net with a set of routable elements in a multi-layer layout region. In some embodiments, the method identifies a route for the net based on different congestion goals on different layers. In other embodiments, the method identifies a route for the net based on different congestion goals between different layer pairs. In some embodiments, the method identifies a route for the net based on both the different congestion goals on different layers and between different layer pairs.

Abstract: Some embodiments of the invention provide a method for routing. The method defines at least one wiring layer that has at least two regions with different local preferred wiring directions. The method then uses the differing local preferred wiring directions to define a global route on the wiring layer. The two regions are a first region with a first local preferred wiring direction, and a second region with a second local preferred wiring direction. The global route traverses the first region along the first local preferred wiring direction and traverses the second region along the second local preferred wiring direction.

Abstract: Disclosed is a method, system, and computer program product for routing, modeling routes, and measuring congestion. In some embodiments, Gcells are implemented with reduced number of nodes to facilitate route modeling and congestion measurement. Some embodiments are particularly suitable for direct congestion and routing analysis of diagonal routing paths. In this way, congestion analysis can be directly performed along diagonal boundaries for diagonal routes, without requiring association with Gcell boundaries on Manhattan routing layers.

Abstract: Some embodiments of the invention provide a method of solving an optimization problem. The problem includes a plurality of elements, and one or more solutions have been previously identified for each element. The method specifies a first solution set that has one identified solution for each element. In some embodiments, the method then iteratively examines all the elements of the problem. During the examination of each particular element, the method iteratively examines all the identified solutions for the particular element. During the examination of each particular solution, the method replaces the current solution for the particular element in the first solution set with a previously unexamined solution for the particular element if the replacement would improve the first set.