11129 search results - page 41 / 2226 » Modeling Search Computing Applications |
84
Voted
CG
2000
Springer
15 years 4 months ago
2000
Springer
This paper proposes a new method for searching two-valued (binary) game trees in games like chess or Go. Lambda-search uses null-moves together with different orders of threat-sequ...
95
Voted
CDB
2004
Springer
15 years 5 months ago
2004
Springer
Constraint Processing and Database techniques overlap significantly. We discuss here the application of a constraint satisfaction technique, called dynamic bundling, to databases....
110
Voted
CVPR
2007
IEEE
16 years 2 months ago
2007
IEEE
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
191
Voted
AMEC
2004
Springer
15 years 5 months ago
2004
Springer
In many two-sided search applications, autonomous agents can enjoy the advantage of parallel search, powered by their ability to handle an enormous amount of information, in a shor...
97
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Resource management and scheduling plays a crucial role in achieving high utilization of resources in grid computing environments. Due to heterogeneity of resources, scheduling an...