2393 search results - page 111 / 479 » Bounds-Consistent Local Search |
112
click to vote
JCO
2007
15 years 19 days ago
2007
The Multidimensional Assignment Problem (MAP) is an NP-hard combinatorial optimization problem occurring in many applications, such as data association, target tracking, and resou...
97
Voted
IPPS
1999
IEEE
15 years 5 months ago
1999
IEEE
Instance based locality optimization 6 is a semi automatic program restructuring method that reduces the number of cache misses. The method imitates the human approach of consideri...
124
Voted
ATAL
2007
Springer
15 years 7 months ago
2007
Springer
Decentralized MDPs provide powerful models of interactions in multi-agent environments, but are often very difficult or even computationally infeasible to solve optimally. Here we...
ALMOB
2006
15 years 24 days ago
2006
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...
93
Voted
IIIX
2006
ACM
15 years 6 months ago
2006
ACM
In recent years there has been growing interest in faceted grouping of documents for Interactive Information Retrieval (IIR). It is suggested that faceted grouping can offer a fl...