Sciweavers

6943 search results - page 733 / 1389
» Representations for evolutionary algorithms
Sort
View
CORR
2007
Springer
105views Education» more  CORR 2007»
15 years 7 months ago
Finding low-weight polynomial multiples using discrete logarithm
— Finding low-weight multiples of a binary polynomial is a difficult problem arising in the context of stream ciphers cryptanalysis. The best algorithms to solve this problem ar...
Frédéric Didier, Yann Laigle-Chapuy
EMNLP
2009
15 years 5 months ago
A Compact Forest for Scalable Inference over Entailment and Paraphrase Rules
A large body of recent research has been investigating the acquisition and application of applied inference knowledge. Such knowledge may be typically captured as entailment rules...
Roy Bar-Haim, Jonathan Berant, Ido Dagan
COMGEO
2011
ACM
15 years 2 months ago
Stabbers of line segments in the plane
The problem of computing a representation of the stabbing lines of a set S of segments in the plane was solved by Edelsbrunner et al. We provide efficient algorithms for the follo...
Mercè Claverol, Delia Garijo, Clara I. Grim...
CORR
2011
Springer
126views Education» more  CORR 2011»
14 years 11 months ago
New Polynomial Classes for Logic-Based Abduction
We address the problem of propositional logic-based abduction, i.e., the problem of searching for a best explanation for a given propositional observation according to a given pro...
Bruno Zanuttini
ICCCI
2011
Springer
14 years 7 months ago
Evolving Equilibrium Policies for a Multiagent Reinforcement Learning Problem with State Attractors
Multiagent reinforcement learning problems are especially difficult because of their dynamism and the size of joint state space. In this paper a new benchmark problem is proposed, ...
Florin Leon