Sciweavers

379 search results - page 5 / 76
» Strong reducibility of partial numberings
Sort
View
GRID
2007
Springer
13 years 7 months ago
Introduce: An Open Source Toolkit for Rapid Development of Strongly Typed Grid Services
Abstract Service-oriented architectures and applications have gained wide acceptance in the Grid computing community. A number of tools and middleware systems have been developed t...
Shannon Hastings, Scott Oster, Stephen Langella, D...
MOBIHOC
2008
ACM
14 years 7 months ago
Strong barrier coverage of wireless sensor networks
Constructing sensor barriers to detect intruders crossing a randomly-deployed sensor network is an important problem. Early results have shown how to construct sensor barriers to ...
Benyuan Liu, Olivier Dousse, Jie Wang, Anwar Saipu...
ACL
2003
13 years 9 months ago
A Tabulation-Based Parsing Method that Reduces Copying
This paper presents a new bottom-up chart parsing algorithm for Prolog along with a compilation procedure that reduces the amount of copying at run-time to a constant number (2) p...
Gerald Penn, Cosmin Munteanu
ECSQARU
2009
Springer
14 years 2 months ago
Complexity and Cautiousness Results for Reasoning from Partially Preordered Belief Bases
Partially preordered belief bases are very convenient for an efficient representation of incomplete knowledge. They offer flexibility and avoid to compare unrelated pieces of inf...
Salem Benferhat, Safa Yahi
IPPS
2006
IEEE
14 years 1 months ago
Selecting the tile shape to reduce the total communication volume
In this paper we revisit the tile-shape selection problem, that has been extensively discussed in bibliography. An efficient approach is proposed for the selection of a suitable t...
Nikolaos Drosinos, Georgios I. Goumas, Nectarios K...