Sciweavers

3946 search results - page 255 / 790
» The computational complexity of choice sets
Sort
View
DAC
1999
ACM
16 years 7 months ago
Memory Exploration for Low Power, Embedded Systems
In embedded system design, the designer has to choose an onchip memory configuration that is suitable for a specific application. To aid in this design choice, we present a memory...
Wen-Tsong Shiue, Chaitali Chakrabarti
KDD
2004
ACM
314views Data Mining» more  KDD 2004»
16 years 7 months ago
Assessment of discretization techniques for relevant pattern discovery from gene expression data
In the domain of gene expression data analysis, various researchers have recently emphasized the promising application of pattern discovery techniques like association rule mining...
Ruggero G. Pensa, Claire Leschi, Jéré...
VLSID
2002
IEEE
98views VLSI» more  VLSID 2002»
16 years 7 months ago
On Test Scheduling for Core-Based SOCs
We present a mathematical model for the problem of scheduling tests for core-based system-on-chip (SOC) VLSI designs. Given a set of tests for each core in the SOC and a set of te...
Sandeep Koranne
ICTAI
2006
IEEE
16 years 22 days ago
Polynomial Regression with Automated Degree: A Function Approximator for Autonomous Agents
In order for an autonomous agent to behave robustly in a variety of environments, it must have the ability to learn approximations to many different functions. The function approx...
Daniel Stronger, Peter Stone
FOSSACS
2005
Springer
16 years 7 days ago
Expressivity of Coalgebraic Modal Logic: The Limits and Beyond
Modal logic has a good claim to being the logic of choice for describing the reactive behaviour of systems modeled as coalgebras. Logics with modal operators obtained from so-calle...
Lutz Schröder