Sciweavers

6167 search results - page 243 / 1234
» Can Refinement be Automated
Sort
View
CIKM
2009
Springer
16 years 17 days ago
Analyzing and evaluating query reformulation strategies in web search logs
Users frequently modify a previous search query in hope of retrieving better results. These modifications are called query reformulations or query refinements. Existing research h...
Jeff Huang, Efthimis N. Efthimiadis
CGF
2002
135views more  CGF 2002»
15 years 5 months ago
Slow Growing Subdivision (SGS) in Any Dimension: Towards Removing the Curse of Dimensionality
In recent years subdivision methods have been one of the most successful techniques applied to the multi-resolution representation and visualization of surface meshes. Extension t...
Valerio Pascucci
POPL
2007
ACM
16 years 6 months ago
Cost semantics for space usage in a parallel language
We describe a framework for better understanding scheduling policies for fine-grained parallel computations and their effect on space usage. We define a profiling semantics that c...
Daniel Spoonhower
AAMAS
2004
Springer
15 years 5 months ago
Temporal Development Methods for Agent-Based
In this paper we overview one specific approach to the formal development of multi-agent systems. This approach is based on the use of temporal logics to represent both the behavio...
Michael Fisher
CL
2000
Springer
15 years 10 months ago
Proof Planning with Multiple Strategies
The control in multi-strategy proof planning goes beyond the control in other automated theorem proving approaches: not only the selection of the inference and the facts for the n...
Erica Melis, Andreas Meier