Sciweavers

834 search results - page 63 / 167
» A Decomposition Technique for Max-CSP
Sort
View
ICML
2007
IEEE
14 years 11 months ago
Large-scale RLSC learning without agony
The advances in kernel-based learning necessitate the study on solving a large-scale non-sparse positive definite linear system. To provide a deterministic approach, recent resear...
Wenye Li, Kin-Hong Lee, Kwong-Sak Leung
ICML
2006
IEEE
14 years 11 months ago
Fast direct policy evaluation using multiscale analysis of Markov diffusion processes
Policy evaluation is a critical step in the approximate solution of large Markov decision processes (MDPs), typically requiring O(|S|3 ) to directly solve the Bellman system of |S...
Mauro Maggioni, Sridhar Mahadevan
VLSID
2002
IEEE
135views VLSI» more  VLSID 2002»
14 years 10 months ago
An Efficient Algorithm for Low Power Pass Transistor Logic Synthesis
In this paper, we address the problem of power dissipation minimization in combinational circuits implemented using pass transistor logic (PTL). We transform the problem of power ...
Rupesh S. Shelar, Sachin S. Sapatnekar
DATE
2009
IEEE
123views Hardware» more  DATE 2009»
14 years 4 months ago
On decomposing Boolean functions via extended cofactoring
—We investigate restructuring techniques based on decomposition/factorization, with the objective to move critical signals toward the output while minimizing area. A specific ap...
Anna Bernasconi, Valentina Ciriani, Gabriella Truc...
DATE
2007
IEEE
146views Hardware» more  DATE 2007»
14 years 4 months ago
Data-flow transformations using Taylor expansion diagrams
Abstract: An original technique to transform functional representation of the design into a structural representation in form of a data flow graph (DFG) is described. A canonical,...
Maciej J. Ciesielski, Serkan Askar, Daniel Gomez-P...