Sciweavers

2905 search results - page 188 / 581
» Formal Memetic Algorithms
Sort
View
CASES
2010
ACM
13 years 7 months ago
Optimizing energy to minimize errors in dataflow graphs using approximate adders
Approximate arithmetic is a promising, new approach to lowenergy designs while tackling reliability issues. We present a method to optimally distribute a given energy budget among...
Zvi M. Kedem, Vincent John Mooney, Kirthi Krishna ...
COMMA
2010
13 years 5 months ago
A characterization of collective conflict for defeasible argumentation
In this paper we define a recursive semantics for warrant in a general defeasible argumentation framework by formalizing a notion of collective (non-binary) conflict among argumen...
Teresa Alsinet, Ramón Béjar, Lluis G...
SBMF
2010
Springer
164views Formal Methods» more  SBMF 2010»
13 years 5 months ago
A Decision Procedure for Bisimilarity of Generalized Regular Expressions
A notion of generalized regular expressions for a large class of systems modeled as coalgebras, and an analogue of Kleene's theorem and Kleene algebra, were recently proposed ...
Marcello M. Bonsangue, Georgiana Caltais, Eugen-Io...
AAAI
2011
12 years 10 months ago
Recognizing Plans with Loops Represented in a Lexicalized Grammar
This paper extends existing plan recognition research to handle plans containing loops. We supply an encoding of plans with loops for recognition, based on techniques used to pars...
Christopher W. Geib, Robert P. Goldman
STOC
2009
ACM
106views Algorithms» more  STOC 2009»
14 years 11 months ago
Random graphs and the parity quantifier
The classical zero-one law for first-order logic on random graphs says that for every first-order property in the theory of graphs and every p (0, 1), the probability that the r...
Phokion G. Kolaitis, Swastik Kopparty