Sciweavers

4480 search results - page 3 / 896
» Prototyping Completion with Constraints Using Computational ...
Sort
View
FPGA
1998
ACM
142views FPGA» more  FPGA 1998»
13 years 12 months ago
A Hybrid Complete-Graph Partial-Crossbar Routing Architecture for Multi-FPGA Systems
Multi-FPGA systems (MFSs) are used as custom computing machines, logic emulators and rapid prototyping vehicles. A key aspect of these systems is their programmable routing archit...
Mohammed A. S. Khalid, Jonathan Rose
WSC
2007
13 years 10 months ago
Optimal scheduling of probabilistic repetitive projects using completed unit and genetic algorithms
In this paper we introduce the completed unit algorithm (CU-AL), a probabilistic scheduling methodology for repetitive projects. The algorithm has two main advantages, simplicity ...
Chachrist Srisuwanrat, Photios G. Ioannou
CAD
2004
Springer
13 years 7 months ago
A shape design system using volumetric implicit PDEs
Solid modeling based on partial differential equations (PDEs) can potentially unify both geometric constraints and functional requirements within a single design framework to mode...
Haixia Du, Hong Qin
EUSFLAT
2007
13 years 9 months ago
Using Generalized Constraints and Protoforms to Deal with Adverbs
Computation with information described in natural language (NL) has intrinsic importance because much of human knowledge is described using these languages. Soft Computing approac...
Andrés Soto, José Angel Olivas, Manu...
KBSE
2008
IEEE
14 years 2 months ago
Query-Aware Test Generation Using a Relational Constraint Solver
We present a novel approach for black-box testing of database management systems (DBMS) using the Alloy tool-set. Given a database schema and an SQL query as inputs, our approach ...
Shadi Abdul Khalek, Bassem Elkarablieh, Yai O. Lal...