990 search results - page 161 / 198 » Using evolution strategies to solve DEC-POMDP problems |
134
click to vote
CAD
2000
Springer
15 years 3 months ago
2000
Springer
Very large and geometrically complex scenes, exceeding millions of polygons and hundreds of objects, arise naturally in many areas of interactive computer graphics. Time-critical ...
119
click to vote
PPOPP
2005
ACM
15 years 9 months ago
2005
ACM
The goal of data mining algorithm is to discover useful information embedded in large databases. Frequent itemset mining and sequential pattern mining are two important data minin...
160
click to vote
AMAI
2004
Springer
15 years 9 months ago
2004
Springer
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
156
click to vote
ERCIMDL
2000
Springer
15 years 7 months ago
2000
Springer
Segmentation of a colour image composed of different kinds of texture regions can be a hard problem, namely to compute for an exact texture fields and a decision of the optimum num...
132
click to vote
IPPS
1997
IEEE
15 years 8 months ago
1997
IEEE
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...