Sciweavers

3317 search results - page 122 / 664
» Strategies in Rigid-Variable Methods
Sort
View
AIPS
2009
15 years 5 months ago
Ant Search Strategies For Planning Optimization
In this paper a planning framework based on Ant Colony Optimization techniques is presented. It is well known that finding optimal solutions to planning problems is a very hard co...
Marco Baioletti, Alfredo Milani, Valentina Poggion...
TROB
2008
112views more  TROB 2008»
15 years 4 months ago
A Complete and Scalable Strategy for Coordinating Multiple Robots Within Roadmaps
Abstract--This paper addresses the challenging problem of finding collision-free trajectories for many robots moving toward individual goals within a common environment. Most popul...
Mike Peasgood, Christopher M. Clark, John McPhee
CAGD
2000
53views more  CAGD 2000»
15 years 4 months ago
Multi-point tool positioning strategy for 5-axis mashining of sculptured surfaces
Multi-point machining (MPM) is a tool positioning technique used for finish machining of sculptured surfaces. In this technique the desired surface is generated at more than one p...
Andrew Warkentin, Fathy Ismail, Sanjeev Bedi
BMCBI
2008
128views more  BMCBI 2008»
15 years 4 months ago
Validation of an NSP-based (negative selection pattern) gene family identification strategy
Background: Gene family identification from ESTs can be a valuable resource for analysis of genome evolution but presents unique challenges in organisms for which the entire genom...
Ronald L. Frank, Cyriac Kandoth, Fikret Erç...
AI
2006
Springer
15 years 4 months ago
Cut-and-solve: An iterative search strategy for combinatorial optimization problems
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
Sharlee Climer, Weixiong Zhang