Example sentences of "[noun sg] space " in BNC.
Next pageNo | Sentence |
---|---|
1 | Because a flat tangent space can always be drawn locally to any point in a Riemann space , Riemann spaces are said to be locally flat ( or locally Euclidean ) . |
2 | It has been argued that the space time we inhabit is a Riemann space , and that locally space–time in free fall is the space time of special relativity . |
3 | Circulation space for vehicles should be reduced in favour of pedestrians and cyclists , with public transport benefiting from this and other favourable measures . |
4 | Noise If the kitchen doubles as a family living space , is near the living room or bedrooms , or if you plan to run the machine on Economy 7 during the night , it is worth finding out the decibel rating of the machine — expressed as dB ( A ) — before buying . |
5 | However , the systems differed in the types of knowledge they used , the interactions of the knowledge , the representation of the search space and the control of the search . |
6 | Hence , an operation in this task 's search space consists of a pair of play operations . |
7 | A search space is a labelled directed graph . |
8 | In addition , a search space has |
9 | Some of the search space 's side branches have also been shown . |
10 | The whole search space is big — much too big to be drawn on one page . |
11 | The edges in the search space are marked accordingly . |
12 | The principal datum input to any search algorithm is a description of its search space . |
13 | The search space is a tree . |
14 | The search space is not necessarily a tree , because properties may be added to the two sets in various orders depending on the order of training instances . |
15 | , the search space is not a tree . |
16 | One a piece is on the board , it is never removed ; so the search space does not have cycles . |
17 | The real search space does not because a real operation extends the list of naive operations which move crates . |
18 | The real search space is almost the cover of the naive one . |
19 | There is a naive search space , whose states are the situations which you could produce , and the real space whose states record ways of obtaining naive states . |
20 | It is not adequate for describing the task 's operators , nor does it suffice for description of the whole search space . |
21 | Thus , in the crates problem , the naive states can be described just by stating which crate is where , but the states of the real search space involve subtler relations . |
22 | In this representation , the search space is a tree with branching ratio no more than 8 . |
23 | It constructs a second more tractable search space . |
24 | The search space of the simulation is formed by partitioning the real search space 's set of states into disjoint subsets . |
25 | The search space of the simulation is formed by partitioning the real search space 's set of states into disjoint subsets . |
26 | Study the search space which is drawn in Figure 9a . |
27 | The start state is the specification of the original task 's search space . |
28 | How big is the search space ? |
29 | Is the search space a tree ? |
30 | How big is the search space ? finite ; depends on the precision . |