Sciweavers

3495 search results - page 230 / 699
» On the random satisfiable process
Sort
View
PUK
2000
15 years 8 months ago
Scheduling in a Planning Environment
In a real planning problem, there exists a set of constraints (both temporal constraints and resource usage constraints) which must be satisfied in order to obtain a feasible plan....
Antonio Garrido Tejero, Miguel A. Salido, Federico...
KIC
2000
15 years 8 months ago
Knowledge Discovery and Data Mining within a Design Environment
Designers, in the process of satisfying design requirements, generally encounter difficulties in, firstly, understanding the problem and secondly, finding a solution [Cross 1998]....
Mark K. D. Haffey, Alex H. B. Duffy
SAC
2010
ACM
15 years 7 months ago
Graph-based verification of static program constraints
Software artifacts usually have static program constraints and these constraints should be satisfied in each reuse. In addition to this, the developers are also required to satisf...
Selim Ciraci, Pim van den Broek, Mehmet Aksit
ICCAD
2004
IEEE
151views Hardware» more  ICCAD 2004»
16 years 4 months ago
Dynamic range estimation for nonlinear systems
It has been widely recognized that the dynamic range information of an application can be exploited to reduce the datapath bitwidth of either processors or ASICs, and therefore th...
Bin Wu, Jianwen Zhu, Farid N. Najm
WSC
2004
15 years 8 months ago
Make-to-Stock Systems with Backorders: IPA Gradients
We consider single-stage, single-product Make-to-Stock systems with random demand and random service (production) rate, where demand shortages at the inventory facility are backor...
Yao Zhao, Benjamin Melamed