4255 search results - page 94 / 851 » On Learning Boolean Functions |
105
click to vote
VMCAI
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We present a context-sensitive compositional analysis of information flow for full (mono-threaded) Java bytecode. Our idea consists in transforming the Java bytecode int...
ICCAD
1999
IEEE
15 years 2 months ago
1999
IEEE
In this paper, an internal design model called FunState (functions driven by state machines) is presented that enables the representation of different types of system components a...
DATE
1998
IEEE
15 years 2 months ago
1998
IEEE
1 Redundancy removal is an important step in combinational logic optimization. After a redundant wire is removed, other originally redundant wires may become irredundant, and some ...
ISAAC
1995
Springer
15 years 1 months ago
1995
Springer
Ordered Binary-Decision Diagrams (OBDD) are the state-of-the-art data structure for boolean function manipulation and there exist several software packages for OBDD manipulation. ...
ALIFE
2006
14 years 10 months ago
2006
An evolutionary system that supports the interaction of neutral and adaptive mutations is investigated. Experimental results on a Boolean function and needle-in-haystack problems s...