Sciweavers

2071 search results - page 205 / 415
» An Empirical Evaluation of LFG-DOP
Sort
View
JAR
2006
106views more  JAR 2006»
15 years 1 months ago
Some Computational Aspects of distance-sat
In many AI fields, the problem of finding out a solution which is as close as possible to a given configuration has to be faced. This paper addresses this problem in a propositiona...
Olivier Bailleux, Pierre Marquis
JSA
2006
114views more  JSA 2006»
15 years 1 months ago
Distributed computing using Java: A comparison of two server designs
This paper proposes a new concurrent data structure, called parallel hash table, for synchronizing the access of multiple threads to resources stored in a shared buffer. We prove ...
Boris Roussev, Jie Wu
SIAMSC
2008
193views more  SIAMSC 2008»
15 years 1 months ago
Exact and Approximate Sparse Solutions of Underdetermined Linear Equations
Abstract. In this paper, we empirically investigate the NP-hard problem of finding sparsest solutions to linear equation systems, i.e., solutions with as few nonzeros as possible. ...
Sadegh Jokar, Marc E. Pfetsch
SIGIR
2008
ACM
15 years 1 months ago
Re-ranking search results using document-passage graphs
We present a novel passage-based approach to re-ranking documents in an initially retrieved list so as to improve precision at top ranks. While most work on passage-based document...
Michael Bendersky, Oren Kurland
STTT
2008
87views more  STTT 2008»
15 years 1 months ago
ProB: an automated analysis toolset for the B method
We present ProB, a validation toolset for the B method. ProB's automated animation facilities allow users to gain confidence in their specifications. ProB also contains a mode...
Michael Leuschel, Michael J. Butler