Sciweavers

6894 search results - page 199 / 1379
» Generation Problems
Sort
View
GECCO
2003
Springer
15 years 11 months ago
Generative Representations for Evolving Families of Designs
Abstract. Since typical evolutionary design systems encode only a single artifact with each individual, each time the objective changes a new set of individuals must be evolved. Wh...
Gregory Hornby
PKDD
1999
Springer
118views Data Mining» more  PKDD 1999»
15 years 10 months ago
Mining Possibilistic Set-Valued Rules by Generating Prime Disjunctions
We describe the problem of mining possibilistic set-valued rules in large relational tables containing categorical attributes taking a finite number of values. An example of such a...
Alexandr A. Savinov
CRYPTO
1998
Springer
105views Cryptology» more  CRYPTO 1998»
15 years 10 months ago
An Efficient Discrete Log Pseudo Random Generator
The exponentiation function in a finite field of order p (a prime number) is believed to be a one-way function. It is well known that O(log log p) bits are simultaneously hard for ...
Sarvar Patel, Ganapathy S. Sundaram
ECP
1997
Springer
68views Robotics» more  ECP 1997»
15 years 10 months ago
Ignoring Irrelevant Facts and Operators in Plan Generation
It is traditional wisdom that one should start from the goals when generating a plan in order to focus the plan generation process on potentially relevant actions. The graphplan sy...
Bernhard Nebel, Yannis Dimopoulos, Jana Koehler
GLVLSI
2009
IEEE
113views VLSI» more  GLVLSI 2009»
15 years 10 months ago
Reducing parity generation latency through input value aware circuits
1 Soft errors caused by cosmic particles and radiation emitted by the packaging are an important problem in contemporary microprocessors. Parity bits are used to detect single bit ...
Yusuf Osmanlioglu, Y. Onur Koçberber, Oguz ...