461 search results - page 2 / 93 » An Algorithm for Bi-Decomposition of Logic Functions |
55
Voted
IJFCS
2000
14 years 11 months ago
2000
This work is about an experimental paradigmatic functional language for programming with P-TIME functions. The language is designed from Intuitionistic Light Affine Logic. It can ...
95
Voted
TFS
2008
14 years 11 months ago
2008
Abstract--Flocking algorithms essentially consist of three components: alignment, cohesion, and separation. To track a desired trajectory, the flock center should move along the de...
66
Voted
IWANN
2005
Springer
15 years 5 months ago
2005
Springer
100
click to vote
PPDP
2009
Springer
15 years 6 months ago
2009
Springer
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...
82
Voted
TCAD
1998
14 years 11 months ago
1998
None of the available minimizers for 2-level hazard-free logic minimization can synthesize very large circuits. This limitation has forced researchers to resort to manual and auto...