Sciweavers

105 search results - page 15 / 21
» Verifying an Applicative ATP Using Multiset Relations
Sort
View
AMAST
2008
Springer
13 years 9 months ago
Towards an Efficient Implementation of Tree Automata Completion
Term Rewriting Systems (TRSs) are now commonly used as a modeling language for applications. In those rewriting based models, reachability analysis, i.e. proving or disproving that...
Emilie Balland, Yohan Boichut, Thomas Genet, Pierr...
JMLR
2006
103views more  JMLR 2006»
13 years 7 months ago
On Model Selection Consistency of Lasso
Sparsity or parsimony of statistical models is crucial for their proper interpretations, as in sciences and social sciences. Model selection is a commonly used method to find such...
Peng Zhao, Bin Yu
JSS
2006
155views more  JSS 2006»
13 years 7 months ago
Semantic component networking: Toward the synergy of static reuse and dynamic clustering of resources in the knowledge grid
Model is a kind of codified knowledge that has been verified in solving problems. Solving a complex problem usually needs a set of models. Using components, the composition of a s...
Hai Zhuge
IDA
2009
Springer
13 years 5 months ago
Trajectory Voting and Classification Based on Spatiotemporal Similarity in Moving Object Databases
We propose a method for trajectory classification based on trajectory voting in Moving Object Databases (MOD). Trajectory voting is performed based on local trajectory similarity. ...
Costas Panagiotakis, Nikos Pelekis, Ioannis Kopana...
JAIR
2011
103views more  JAIR 2011»
13 years 2 months ago
Automated Search for Impossibility Theorems in Social Choice Theory: Ranking Sets of Objects
We present a method for using standard techniques from satisfiability checking to automatically verify and discover theorems in an area of economic theory known as ranking sets o...
C. Geist, Ulrich Endriss