Sciweavers

153 search results - page 3 / 31
» On an equivalence in discrete extremal problems
Sort
View
102
Voted
CPAIOR
2009
Springer
15 years 6 months ago
The Polytope of Context-Free Grammar Constraints
Context-free grammar constraints enforce that a sequence of variables forms a word in a language defined by a context-free grammar. The constraint has received a lot of attention ...
Gilles Pesant, Claude-Guy Quimper, Louis-Martin Ro...
AAAI
2000
15 years 1 months ago
MarketSAT: An Extremely Decentralized (but Really Slow) Algorithm for Propositional Satisfiability
We describe MarketSAT, a highly decentralized, marketbased algorithm for propositional satisfiability. The approach is based on a formulation of satisfiability as production on a ...
William E. Walsh, Michael P. Wellman
CSDA
2007
131views more  CSDA 2007»
14 years 11 months ago
Bivariate density estimation using BV regularisation
In this paper we study the problem of bivariate density estimation. The aim is to find a density function with the smallest number of local extreme values which is adequate with ...
Andreas Obereder, Otmar Scherzer, Arne Kovac
AUTOMATICA
2005
103views more  AUTOMATICA 2005»
14 years 11 months ago
Norm invariant discretization for sampled-data fault detection
In this paper, the problem of fault detection in sampled-data systems is studied. It is shown that norms of a sampled system are equal to the corresponding norms of a certain disc...
Iman Izadi, Tongwen Chen, Qing Zhao
INFORMATICALT
2007
104views more  INFORMATICALT 2007»
14 years 11 months ago
Key Agreement Protocol (KAP) Using Conjugacy and Discrete Logarithm Problems in Group Representation Level
The key agreement protocol based on infinite non-commutative group presentation and representation levels is proposed. Two simultaneous problems in group representation level are ...
Eligijus Sakalauskas, Povilas Tvarijonas, Andrius ...