3267 search results - page 452 / 654 » Generalized quasirandom graphs |
154
click to vote
AAAI
2004
15 years 8 months ago
2004
In this paper we introduce and study Shortest Path Discovery (SPD) problems, a generalization of shortest path problems: In SPD one is given a directed edgeweighted graph and the ...
183
click to vote
AAAI
2006
15 years 8 months ago
2006
Several methods for breaking value symmetries have been proposed recently in the constraint programming community. They can be used in conjunction with variable symmetry breaking ...
170
click to vote
IADIS
2004
15 years 8 months ago
2004
We describe an approach for constructing search spaces that consist of highly relevant web pages using similarities between the contents of linked web pages to represent their lin...
171
click to vote
DMDW
2001
15 years 8 months ago
2001
The problem of data cleaning, which consists of removing inconsistencies and errors from original data sets, is well known in the area of decision support systems and data warehou...
192
click to vote
CCCG
2003
15 years 8 months ago
2003
We consider the problem of designing a transportation network to allow the residents of the network to avail service provided by a single facility whose location is predetermined....