Sciweavers

532 search results - page 62 / 107
» Tree exploration with advice
Sort
View
CP
1998
Springer
13 years 12 months ago
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
We use a local search method we term Large Neighbourhood Search (LNS) for solving vehicle routing problems. LNS meshes well with constraint programming technology and is analogous...
Paul Shaw
ICRA
2000
IEEE
176views Robotics» more  ICRA 2000»
13 years 11 months ago
RRT-Connect: An Efficient Approach to Single-Query Path Planning
A simple and efficient randomized algorithm is presented for solving single-query path planning problems in high-dimensional configuration spaces. The method works by incrementall...
James J. Kuffner Jr., Steven M. LaValle
DMIN
2007
158views Data Mining» more  DMIN 2007»
13 years 9 months ago
Mining Frequent Itemsets Using Re-Usable Data Structure
- Several algorithms have been introduced for mining frequent itemsets. The recent datasettransformation approach suffers either from the possible increasing in the number of struc...
Mohamed Yakout, Alaaeldin M. Hafez, Hussein Aly
GECCO
2008
Springer
128views Optimization» more  GECCO 2008»
13 years 8 months ago
A tree-based GA representation for the portfolio optimization problem
Recently, a number of works have been done on how to use Genetic Algorithms to solve the Portfolio Optimization problem, which is an instance of the Resource Allocation problem cl...
Claus de Castro Aranha, Hitoshi Iba
ENTCS
2007
109views more  ENTCS 2007»
13 years 7 months ago
Constructive Membership Predicates as Index Types
In the constructive setting, membership predicates over recursive types are inhabited by terms indexing the elements that satisfy the criteria for membership. In this paper, we mo...
James Caldwell, Josef Pohl