1095 search results - page 201 / 219 » Preprocessing of Intractable Problems |
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
Distributed Lagrangian Relaxation Protocol (DisLRP) has been proposed to solve a distributed combinatorial maximization problem called the Generalized Mutual Assignment Problem (G...
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
SIBGRAPI
2008
IEEE
14 years 2 months ago
2008
IEEE
Range searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in Rd into a data structure, so that it is possible to det...
KDD
2005
ACM
14 years 1 months ago
2005
ACM
This paper describes TIPPPS (Time Interleaved Product Purchase Prediction System), which analyses billing data of corporate customers in a large telecommunications company in orde...
BIRTHDAY
2010
Springer
14 years 24 days ago
2010
Springer
Abstract. Database preprocessing in order to create an index often permits considerable speedup in search compared to the iterated query of an unprocessed database. In this paper w...