Sciweavers

7092 search results - page 657 / 1419
» Parallelizing constraint programs
Sort
View
ICLP
2010
Springer
15 years 10 months ago
Tight Semantics for Logic Programs
We define the Tight Semantics (TS), a new semantics for all NLPs complying with the requirements of: 2-valued semantics; preserving the models of SM; guarantee of model existence...
Luís Moniz Pereira, Alexandre Miguel Pinto
BIOINFORMATICS
2006
106views more  BIOINFORMATICS 2006»
15 years 6 months ago
Identification of biochemical networks by S-tree based genetic programming
Motivation: Most previous approaches to model biochemical networks havefocusedeither on the characterization of a networkstructurewith a number of components or on the estimation ...
Dong-Yeon Cho, Kwang-Hyun Cho, Byoung-Tak Zhang
TCAD
2008
136views more  TCAD 2008»
15 years 6 months ago
A Geometric Programming-Based Worst Case Gate Sizing Method Incorporating Spatial Correlation
We present an efficient optimization scheme for gate sizing in the presence of process variations. Our method is a worst-case design scheme, but it reduces the pessimism involved i...
Jaskirat Singh, Zhi-Quan Luo, Sachin S. Sapatnekar
IPPS
2007
IEEE
16 years 23 days ago
STAMP: A Universal Algorithmic Model for Next-Generation Multithreaded Machines and Systems
We propose a generic algorithmic model called STAMP (Synchronous, Transactional, and Asynchronous MultiProcessing) as a universal performance and power complexity model for multit...
Michel Dubois, Hyunyoung Lee, Lan Lin
IPPS
2006
IEEE
16 years 14 days ago
A stochastic multi-objective algorithm for the design of high performance reconfigurable architectures
The increasing demand for FPGAs and reconfigurable hardware targeting high performance low power applications has lead to an increasing requirement for new high performance reconf...
Wing On Fung, Tughrul Arslan