Sciweavers

62 search results - page 7 / 13
» Generalized cofactoring for logic function evaluation
Sort
View
FOSSACS
2003
Springer
14 years 18 days ago
Type Assignment for Intersections and Unions in Call-by-Value Languages
We develop a system of type assignment with intersection types, union types, indexed types, and universal and existential dependent types that is sound in a call-by-value functiona...
Joshua Dunfield, Frank Pfenning
FPGA
2004
ACM
126views FPGA» more  FPGA 2004»
14 years 23 days ago
A synthesis oriented omniscient manual editor
The cost functions used to evaluate logic synthesis transformations for FPGAs are far removed from the final speed and routability determined after placement, routing and timing a...
Tomasz S. Czajkowski, Jonathan Rose
DIS
2005
Springer
14 years 28 days ago
Support Vector Inductive Logic Programming
Abstract. In this paper we explore a topic which is at the intersection of two areas of Machine Learning: namely Support Vector Machines (SVMs) and Inductive Logic Programming (ILP...
Stephen Muggleton, Huma Lodhi, Ata Amini, Michael ...
LPKR
1997
Springer
13 years 11 months ago
Knowledge Representation with Logic Programs
In this overview we show how Knowledge Representation (KR) can be done with the help of generalized logic programs. We start by introducing the core of PROLOG, which is based on de...
Gerhard Brewka, Jürgen Dix
FPGA
2010
ACM
209views FPGA» more  FPGA 2010»
14 years 4 months ago
FPGA power reduction by guarded evaluation
Guarded evaluation is a power reduction technique that involves identifying sub-circuits (within a larger circuit) whose inputs can be held constant (guarded) at specific times d...
Chirag Ravishankar, Jason Helge Anderson