Sciweavers

11129 search results - page 41 / 2226
» Modeling Search Computing Applications
Sort
View
CG
2000
Springer
15 years 2 months ago
Lambda-Search in Game Trees - with Application to Go
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...
Thomas Thomsen
CDB
2004
Springer
143views Database» more  CDB 2004»
15 years 3 months ago
Constraint Processing Techniques for Improving Join Computation: A Proof of Concept
Constraint Processing and Database techniques overlap significantly. We discuss here the application of a constraint satisfaction technique, called dynamic bundling, to databases....
Anagh Lal, Berthe Y. Choueiry
CVPR
2007
IEEE
15 years 12 months ago
Approximate Nearest Subspace Search with Applications to Pattern Recognition
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...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor
AMEC
2004
Springer
15 years 3 months ago
Agents' Strategies for the Dual Parallel Search in Partnership Formation Applications
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...
David Sarne, Sarit Kraus
CORR
2010
Springer
179views Education» more  CORR 2010»
14 years 8 months ago
An Economic-based Resource Management and Scheduling for Grid Computing Applications
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...
G. Murugesan, C. Chellappan