Sciweavers

2430 search results - page 311 / 486
» Computing Tutte Polynomials
Sort
View
131
Voted
ICAI
2009
15 years 1 months ago
An Alternative Representation for QBF
Quantified Boolean formulas are a powerful representation that have been used to capture and solve a variety of problems in Artificial Intelligence. While most research has focused...
Anja Remshagen, Klaus Truemper
147
Voted
IJISEC
2010
150views more  IJISEC 2010»
15 years 29 days ago
Efficient online/offline identity-based signature for wireless sensor network
In this paper, we present an online/offline identity-based signature scheme for the wireless sensor network (WSN). We argue that due to significant reduction in costs of computati...
Joseph K. Liu, Joonsang Baek, Jianying Zhou, Yanji...
132
Voted
CDC
2010
IEEE
14 years 10 months ago
On the marginal instability of linear switched systems
Stability properties for continuous-time linear switched systems are at first determined by the (largest) Lyapunov exponent associated with the system, which is the analogous of t...
Yacine Chitour, Paolo Mason, Mario Sigalotti
120
Voted
JMLR
2010
115views more  JMLR 2010»
14 years 10 months ago
Bayesian structure discovery in Bayesian networks with less space
Current exact algorithms for score-based structure discovery in Bayesian networks on n nodes run in time and space within a polynomial factor of 2n . For practical use, the space ...
Pekka Parviainen, Mikko Koivisto
131
Voted
TSMC
2010
14 years 10 months ago
Comparison of Optimal Solutions to Real-Time Path Planning for a Mobile Vehicle
In this paper, we present two near-optimal methods to determine the real-time collision-free path for a mobile vehicle moving in a dynamically changing environment. The proposed de...
Jian Yang, Zhihua Qu, Jing Wang 0005, Kevin L. Con...