Sciweavers

1144 search results - page 210 / 229
» Logic programming for combinatorial problems
Sort
View
FPGA
2004
ACM
140views FPGA» more  FPGA 2004»
13 years 11 months ago
Using reconfigurability to achieve real-time profiling for hardware/software codesign
Embedded systems combine a processor with dedicated logic to meet design specifications at a reasonable cost. The attempt to amalgamate two distinct design environments introduces...
Lesley Shannon, Paul Chow
ILP
2007
Springer
14 years 1 months ago
Learning to Assign Degrees of Belief in Relational Domains
A recurrent question in the design of intelligent agents is how to assign degrees of beliefs, or subjective probabilities, to various events in a relational environment. In the sta...
Frédéric Koriche
DFT
2003
IEEE
113views VLSI» more  DFT 2003»
14 years 28 days ago
Buffer and Controller Minimisation for Time-Constrained Testing of System-On-Chip
Test scheduling and Test Access Mechanism (TAM) design are two important tasks in the development of a System-on-Chip (SOC) test solution. Previous test scheduling techniques assu...
Anders Larsson, Erik Larsson, Petru Eles, Zebo Pen...
UIST
2003
ACM
14 years 26 days ago
Stylus input and editing without prior selection of mode
This paper offers a solution to the mode problem in computer sketch/notetaking programs. Conventionally, the user must specify the intended "draw" or "command"...
Eric Saund, Edward Lank
DAGSTUHL
1996
13 years 9 months ago
A Self-Applicable Supercompiler
A supercompiler is a program which can performa deep transformation of programsusing a principle which is similarto partial evaluation, and can be referred to as metacomputation. ...
Andrei P. Nemytykh, Victoria A. Pinchuk, Valentin ...