Sciweavers

835 search results - page 93 / 167
» Finding Optimal Solutions to Cooperative Pathfinding Problem...
Sort
View
AIPS
2006
14 years 11 months ago
Spacetrack: Trading off Quality and Utilization in Oversubscribed Schedules
Many scheduling problems are posed as optimization problems where the goal is to find a feasible schedule that maximizes the utilization of some resource. In some domains it is al...
Andrew M. Sutton, Adele E. Howe, L. Darrell Whitle...
EH
2004
IEEE
89views Hardware» more  EH 2004»
15 years 1 months ago
Evolution in Materio: Initial Experiments with Liquid Crystal
Intrinsic evolution is often limited to using standard electronic components as the media for problem solving. It has been argued that because such components are human designed a...
Simon Harding, Julian Francis Miller
IEICET
2006
55views more  IEICET 2006»
14 years 10 months ago
Inserting Points Uniformly at Every Instance
A problem of arranging n points as uniformly as possible, which is equivalent to that of packing n equal and non-overlapping circles in a unit square, is frequently asked. In this ...
Sachio Teramoto, Tetsuo Asano, Naoki Katoh, Benjam...
EOR
2006
125views more  EOR 2006»
14 years 10 months ago
A genetic algorithm for robotic assembly line balancing
Flexibility and automation in assembly lines can be achieved by the use of robots. The robotic assembly line balancing (RALB) problem is defined for robotic assembly line, where d...
Gregory Levitin, Jacob Rubinovitz, Boris Shnits
AIPS
2006
14 years 11 months ago
Sequential Monte Carlo in Probabilistic Planning Reachability Heuristics
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
Daniel Bryce, Subbarao Kambhampati, David E. Smith