835 search results - page 54 / 167 » Finding Optimal Solutions to Cooperative Pathfinding Problem... |
IPPS
2010
IEEE
14 years 7 months ago
2010
IEEE
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
AAAI
2000
14 years 11 months ago
2000
In problem solving, it is often important not only to find a solution but also to be able to explain it. We use the game of Bridge to illustrate how tactics, which formalise domai...
GREC
2005
Springer
15 years 3 months ago
2005
Springer
This paper presents a solution for online composite sketchy shape recognition. The kernel of the strategy treats both stroke segmentation and sketch recognition as an optimization ...
ESOP
2006
Springer
15 years 1 months ago
2006
Springer
We present and solve a path optimization problem on programs. Given a set of program nodes, called critical nodes, we find a shortest path through the program's control flow g...
ISCAS
2006
IEEE
15 years 3 months ago
2006
IEEE
The efficient design of multiplierless implementa- The goal is to find the optimal sub-expressions across all N dot tions of constant matrix multipliers is challenged by the huge p...