1984 search results - page 140 / 397 » The colourful feasibility problem |
EOR
2007
13 years 10 months ago
2007
The stability domain is a feasible set for numerous optimization problems. D-decomposition technique is targeted to describe the stability domain in the parameter space for linear...
RAS
2006
13 years 10 months ago
2006
This paper describes an algorithm to calculate near-optimal minimum time trajectories for four wheeled omnidirectional vehicles, which can be used as part of a high-level path pla...
AUTOMATICA
2005
13 years 10 months ago
2005
Trajectory generation for nonlinear control systems is an important and difficult problem. In this paper, we provide a constructive method for hierarchical trajectory refinement. ...
APIN
2004
13 years 10 months ago
2004
Here we first describe the concepts, components and features of CBR. The feasibility and merits of using CBR for problem solving is then explained. This is followed by a descriptio...
GC
2002
Springer
13 years 10 months ago
2002
Springer
One of the classical problems concerning the peg solitaire game is the feasibility issue. Tools used to show the infeasibility of various peg games include valid inequalities, know...