Sciweavers

41 search results - page 6 / 9
» Propositional Satisfiability and Constraint Programming: A c...
Sort
View
ASPDAC
2008
ACM
69views Hardware» more  ASPDAC 2008»
13 years 9 months ago
Fast, quasi-optimal, and pipelined instruction-set extensions
Nowadays many customised embedded processors offer the possibility of speeding up an application by implementing it using Application-Specific Functional units (AFUs). However, th...
Ajay K. Verma, Philip Brisk, Paolo Ienne
EAAI
2006
123views more  EAAI 2006»
13 years 7 months ago
Applications of artificial intelligence for optimization of compressor scheduling
This paper presents a feasibility study of evolutionary scheduling for gas pipeline operations. The problem is complex because of several constraints that must be taken into consi...
Hanh H. Nguyen, Christine W. Chan
ESEM
2008
ACM
13 years 9 months ago
A constrained regression technique for cocomo calibration
Building cost estimation models is often considered a search problem in which the solver should return an optimal solution satisfying an objective function. This solution also nee...
Vu Nguyen, Bert Steece, Barry W. Boehm
SAS
2010
Springer
149views Formal Methods» more  SAS 2010»
13 years 6 months ago
Boxes: A Symbolic Abstract Domain of Boxes
Symbolic Abstract Domain of Boxes Arie Gurfinkel and Sagar Chaki Carnegie Mellon University Abstract. Numeric abstract domains are widely used in program analyses. The simplest nu...
Arie Gurfinkel, Sagar Chaki
SIAMJO
2010
136views more  SIAMJO 2010»
13 years 2 months ago
A New Exchange Method for Convex Semi-Infinite Programming
In this paper we propose a new exchange method for solving convex semi-infinite programming (CSIP) problems. We introduce a new dropping-rule in the proposed exchange algorithm, wh...
Liping Zhang, Soon-Yi Wu, Marco A. López