835 search results - page 116 / 167 » Finding Optimal Solutions to Cooperative Pathfinding Problem... |
ICML
2006
IEEE
15 years 10 months ago
2006
IEEE
When the transition probabilities and rewards of a Markov Decision Process are specified exactly, the problem can be solved without any interaction with the environment. When no s...
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
As the Flexible Job Shop Scheduling Problem (or FJSP) is strongly NP-hard, using an evolutionary approach to find near-optimal solutions requires effective chromosome representatio...
SSPR
1998
Springer
15 years 2 months ago
1998
Springer
In this paper, a statistical clustering model and algorithm have been discussed. Finding the optimal solution to clustering problem is transformed into simulating the equilibrium ...
SAT
2010
Springer
15 years 1 months ago
2010
Springer
Non-trivial linear straight-line programs over the Galois field of two elements occur frequently in applications such as encryption or high-performance computing. Finding the shor...
CMSB
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. The important research objective of identifying genes with similar behavior with respect to different conditions has recently been tackled with biclustering techniques. I...