944 search results - page 68 / 189 » Heuristic Search for Large Problems With Real Costs |
127
click to vote
CONSTRAINTS
2007
15 years 1 months ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
182
click to vote
ICDE
2007
IEEE
16 years 3 months ago
2007
IEEE
We introduce the notion of a data topology and the problem of topology search over databases. A data topology summarizes the set of all possible relationships that connect a given...
123
Voted
MOBICOM
2004
ACM
15 years 7 months ago
2004
ACM
In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large network. Applications of this problem include searching fo...
127
click to vote
INFOCOM
1995
IEEE
15 years 5 months ago
1995
IEEE
Establishing a multicast tree in a point-to-point network of switch nodes, such as a wide-area ATM network, is often modeled as the NP-complete Steiner problem in networks. In thi...
134
click to vote
MMB
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...