Sciweavers

994 search results - page 137 / 199
» Custom Computing Machines for the Set Covering Problem
Sort
View
VMCAI
2005
Springer
15 years 6 months ago
On the Complexity of Error Explanation
When a system fails to satisfy its specification, the model checker produces an error trace (or counter-example) that demonstrates an undesirable behavior, which is then used in d...
Nirman Kumar, Viraj Kumar, Mahesh Viswanathan
AAAI
2006
15 years 1 months ago
Unsupervised Order-Preserving Regression Kernel for Sequence Analysis
In this work, a generalized method for learning from sequence of unlabelled data points based on unsupervised order-preserving regression is proposed. Sequence learning is a funda...
Young-In Shin
JCM
2006
169views more  JCM 2006»
15 years 14 days ago
Trends in Middleware for Mobile Ad Hoc Networks
The use of middleware has extended from simply facilitating applications' communication to a broad set of services supporting a huge spectrum of networked and distributed comp...
Salem Hadim, Jameela Al-Jaroodi, Nader Mohamed
TACAS
2010
Springer
160views Algorithms» more  TACAS 2010»
15 years 7 months ago
Optimal Tableau Algorithms for Coalgebraic Logics
Deciding whether a modal formula is satisfiable with respect to a given set of (global) assumptions is a question of fundamental importance in applications of logic in computer sc...
Rajeev Goré, Clemens Kupke, Dirk Pattinson
106
Voted
FSTTCS
2009
Springer
15 years 7 months ago
Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
M. Praveen, Kamal Lodaya