Sciweavers

2771 search results - page 76 / 555
» A General Computational Treatment of the Comparative
Sort
View
GLVLSI
2009
IEEE
122views VLSI» more  GLVLSI 2009»
15 years 4 months ago
Enhancing SAT-based sequential depth computation by pruning search space
The sequential depth determines the completeness of bounded model checking in design verification. Recently, a SATbased method is proposed to compute the sequential depth of a de...
Yung-Chih Chen, Chun-Yao Wang
ATAL
2008
Springer
14 years 11 months ago
A best-first anytime algorithm for computing optimal coalition structures
This work presents a best-first anytime algorithm for computing optimal coalition structures. The approach is novel in that it generates coalition structures based on coalition va...
Chattrakul Sombattheera, Aditya Ghose
IDTRUST
2010
ACM
15 years 4 months ago
Computational techniques for increasing PKI policy comprehension by human analysts
Natural-language policies found in X.509 PKI describe an organization’s stated policy as a set of requirements for trust. The widespread use of X.509 underscores the importance ...
Gabriel A. Weaver, Scott A. Rea, Sean W. Smith
CIKM
2006
Springer
15 years 1 months ago
Constrained subspace skyline computation
In this paper we introduce the problem of Constrained Subspace Skyline Queries. This class of queries can be thought of as a generalization of subspace skyline queries using range...
Evangelos Dellis, Akrivi Vlachou, Ilya Vladimirski...
INFOCOM
2010
IEEE
14 years 7 months ago
On Computing Compression Trees for Data Collection in Wireless Sensor Networks
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
Jian Li, Amol Deshpande, Samir Khuller