Sciweavers

2725 search results - page 242 / 545
» Constraint Solving for Interpolation
Sort
View
ATMOS
2007
119views Optimization» more  ATMOS 2007»
15 years 8 months ago
Models for Railway Track Allocation
The optimal track allocation problem (OPTRA) is to find, in a given railway network, a conflict free set of train routes of maximum value. We study two types of integer programmi...
Ralf Borndörfer, Thomas Schlechte
STAIRS
2008
143views Education» more  STAIRS 2008»
15 years 8 months ago
Domain-Dependent View of Multiple Robots Path Planning
We study a problem of path planning for a group of robots in this paper. The problem is stated as a finding of spatial-temporal paths through which the robots can go from their ini...
Pavel Surynek
IJCAI
1989
15 years 8 months ago
Constrained Heuristic Search
Cognitive architectures aspire for generality both in terms of problem solving and learning across a range of problems, yet to date few examples of domain independent learning has...
Mark S. Fox, Norman M. Sadeh, Can A. Baykan
COR
2010
105views more  COR 2010»
15 years 7 months ago
Effective formulation reductions for the quadratic assignment problem
In this paper we study two formulation reductions for the quadratic assignment problem (QAP). In particular we apply these reductions to the well known Adams and Johnson [2] integ...
Huizhen Zhang, Cesar Beltran-Royo, Miguel Constant...
JVCA
2007
128views more  JVCA 2007»
15 years 7 months ago
Impulse-based dynamic simulation in linear time
This paper describes an impulse-based dynamic simulation method for articulated bodies which has a linear time complexity. Existing linear-time methods are either based on a reduc...
Jan Bender