Sciweavers

2208 search results - page 311 / 442
» Memory Practices in the Sciences
Sort
View
IJCAI
1997
14 years 11 months ago
Interleaved Depth-First Search
In tree search, depth-first search (DFS) often uses ordering successor heuristics. If the heuristic makes a mistake ordering a bad successor (without goals in its subtree) before ...
Pedro Meseguer
CANDT
2009
14 years 11 months ago
Overhearing the crowd: an empirical examination of conversation reuse in a technical support community
This paper describes a mixed method, empirical analysis of conversation reuse in an online technical support community. I find that the same characteristics that make the conversa...
Derek L. Hansen
ACTA
2010
191views more  ACTA 2010»
14 years 10 months ago
Automata-based verification of programs with tree updates
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...
Peter Habermehl, Radu Iosif, Tomás Vojnar
CN
2008
100views more  CN 2008»
14 years 10 months ago
An efficient and secure event signature (EASES) protocol for peer-to-peer massively multiplayer online games
In recent years, massively multiplayer online games (MMOGs) have become very popular by providing more entertainment and sociability than single-player games. In order to prevent c...
Mo-Che Chan, Shun-Yun Hu, Jehn-Ruey Jiang
CORR
2010
Springer
96views Education» more  CORR 2010»
14 years 10 months ago
LSMR: An iterative algorithm for sparse least-squares problems
Abstract. An iterative method LSMR is presented for solving linear systems Ax = b and leastsquares problem min Ax - b 2, with A being sparse or a fast linear operator. LSMR is base...
David Fong, Michael Saunders