836 search results - page 49 / 168 » On the Complexity of Train Assignment Problems |
149
click to vote
CPAIOR
2008
Springer
15 years 5 months ago
2008
Springer
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
136
click to vote
GPEM
2008
15 years 3 months ago
2008
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
144
click to vote
AAAI
2006
15 years 5 months ago
2006
We describe an application of AI search and information visualization techniques to the problem of school redistricting, in which students are assigned to home schools within a co...
129
click to vote
ICDM
2003
IEEE
15 years 9 months ago
2003
IEEE
There is a ever-growing need to add structure in the form of semantic markup to the huge amounts of unstructured text data now available. We present the technique of shallow seman...
132
click to vote
KDD
2004
ACM
15 years 9 months ago
2004
ACM
In this paper, we propose a novel data mining technique for the efficient damage detection within the large-scale complex mechanical structures. Every mechanical structure is defi...