Sciweavers

1021 search results - page 125 / 205
» Concepts in Proof Planning
Sort
View
COMSWARE
2007
IEEE
14 years 3 months ago
Smaller Connected Dominating Sets in Ad Hoc and Sensor Networks based on Coverage by Two-Hop Neighbors
— In this paper, we focus on the construction of an efficient dominating set in ad hoc and sensor networks. A set of nodes is said to be dominating if each node is either itself...
François Ingelrest, David Simplot-Ryl, Ivan...
FOCS
2006
IEEE
14 years 2 months ago
Computing Nash Equilibria: Approximation and Smoothed Complexity
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria an...
Xi Chen, Xiaotie Deng, Shang-Hua Teng
TABLEAUX
2005
Springer
14 years 2 months ago
A Tableau-Based Explainer for DL Subsumption
This paper describes the implementation of a tableau-based reasoning component which is capable of providing quasi natural language explanations for subsumptions within ALEHFR+ TBo...
Thorsten Liebig, Michael Halfmann
EUROCRYPT
2004
Springer
14 years 2 months ago
Traceable Signatures
Abstract. This work presents a new privacy primitive called “Traceable Signatures”, together with an efficient provably secure implementation. To this end, we develop the unde...
Aggelos Kiayias, Yiannis Tsiounis, Moti Yung
DATE
2004
IEEE
128views Hardware» more  DATE 2004»
14 years 19 days ago
Enhanced Diameter Bounding via Structural
Bounded model checking (BMC) has gained widespread industrial use due to its relative scalability. Its exhaustiveness over all valid input vectors allows it to expose arbitrarily ...
Jason Baumgartner, Andreas Kuehlmann