Sciweavers

106 search results - page 4 / 22
» Trees with exponentially growing costs
Sort
View
FUIN
2010
143views more  FUIN 2010»
13 years 4 months ago
Cluster Tree Elimination for Distributed Constraint Optimization with Quality Guarantees
Some distributed constraint optimization algorithms use a linear number of messages in the number of agents, but of exponential size. This is often the main limitation for their pr...
Ismel Brito, Pedro Meseguer
IROS
2008
IEEE
151views Robotics» more  IROS 2008»
14 years 1 months ago
Transition-based RRT for path planning in continuous cost spaces
This paper presents a new method called Transition-based RRT (T-RRT) for path planning problems in continuous cost spaces. It combines the exploration strength of the RRT algorith...
Leonard Jaillet, Juan Cortés, Thierry Sim&e...
COR
2011
13 years 2 months ago
MIP models for connected facility location: A theoretical and computational study
This article comprises the first theoretical and computational study on mixed integer programming (MIP) models for the connected facility location problem (ConFL). ConFL combines...
Stefan Gollowitzer, Ivana Ljubic
ICDE
2002
IEEE
153views Database» more  ICDE 2002»
14 years 8 months ago
From XML Schema to Relations: A Cost-Based Approach to XML Storage
As Web applications manipulate an increasing amount of XML, there is a growing interest in storing XML data in relational databases. Due to the mismatch between the complexity of ...
Jérôme Siméon, Juliana Freire,...
PAKDD
2004
ACM
186views Data Mining» more  PAKDD 2004»
14 years 25 days ago
CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees
Abstract. Tree structures are used extensively in domains such as computational biology, pattern recognition, XML databases, computer networks, and so on. One important problem in ...
Yun Chi, Yirong Yang, Yi Xia, Richard R. Muntz