Sciweavers

86 search results - page 7 / 18
» Satisfiability Algorithms and Finite Quantification
Sort
View
CORR
2010
Springer
144views Education» more  CORR 2010»
14 years 9 months ago
Algorithmic Verification of Single-Pass List Processing Programs
We introduce streaming data string transducers that map input data strings to output data strings in a single left-to-right pass in linear time. Data strings are (unbounded) seque...
Rajeev Alur, Pavol Cerný
MST
2008
124views more  MST 2008»
14 years 9 months ago
Complexity of Clausal Constraints Over Chains
We investigate the complexity of the satisfiability problem of constraints over finite totally ordered domains. In our context, a clausal constraint is a disjunction of inequaliti...
Nadia Creignou, Miki Hermann, Andrei A. Krokhin, G...
ATVA
2010
Springer
154views Hardware» more  ATVA 2010»
14 years 10 months ago
Lattice-Valued Binary Decision Diagrams
Abstract. This work introduces a new data structure, called Lattice-Valued Binary Decision Diagrams (or LVBDD for short), for the compact representation and manipulation of functio...
Gilles Geeraerts, Gabriel Kalyon, Tristan Le Gall,...
76
Voted
AUTOMATICA
2008
75views more  AUTOMATICA 2008»
14 years 9 months ago
Computations of probabilistic output admissible set for uncertain constrained systems
Abstract-- This paper considers uncertain constrained systems, and develops a method for computing a probabilistic output admissible (POA) set which is a set of initial states prob...
Takeshi Hatanaka, Kiyotsugu Takaba
KDD
2004
ACM
209views Data Mining» more  KDD 2004»
15 years 9 months ago
Tracking dynamics of topic trends using a finite mixture model
In a wide range of business areas dealing with text data streams, including CRM, knowledge management, and Web monitoring services, it is an important issue to discover topic tren...
Satoshi Morinaga, Kenji Yamanishi