248 search results - page 32 / 50 » The Relative Complexity of NP Search Problems |
IROS
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract— This paper presents a new approach to the multirobot map-alignment problem that enables teams of robots to build joint maps without initial knowledge of their relative ...
BMCBI
2006
13 years 7 months ago
2006
Integration of heterogeneous data types is a challenging problem, especially in biology, where the number of databases and data types increase rapidly. Amongst the problems that o...
ICDE
2007
IEEE
14 years 2 months ago
2007
IEEE
In this work, we propose a multi-relational concept discovery method for business intelligence applications. Multi-relational data mining finds interesting patterns that span ove...
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
Markov logic networks (MLNs) use firstorder formulas to define features of Markov networks. Current MLN structure learners can only learn short clauses (4-5 literals) due to extre...
CP
2007
Springer
14 years 1 months ago
2007
Springer
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...