Sciweavers

2266 search results - page 118 / 454
» Some Solutions to the Ignoring Problem
Sort
View
CPAIOR
2007
Springer
15 years 7 months ago
Cost-Bounded Binary Decision Diagrams for 0-1 Programming
Abstract. In recent work binary decision diagrams (BDDs) were introduced as a technique for postoptimality analysis for integer programming. In this paper we show that much smaller...
Tarik Hadzic, John N. Hooker
IAT
2008
IEEE
15 years 8 months ago
An Improved Discrete Particle Swarm Optimization Based on Cooperative Swarms
The discrete particle swarm optimization (DPSO) is a kind of particle swarm optimization (PSO) algorithm to find optimal solutions for discrete problems. This paper proposes an i...
Yiheng Xu, Qiangwei Wang, Jinglu Hu
ACL2
2006
ACM
15 years 7 months ago
Double rewriting for equivalential reasoning in ACL2
Several users have had problems using equivalence-based rewriting in ACL2 because the ACL2 rewriter caches its results. We describe this problem in some detail, together with a pa...
Matt Kaufmann, J. Strother Moore
EUROMICRO
1999
IEEE
15 years 5 months ago
Design Space Exploration in System Level Synthesis under Memory Constraints
This paper addresses the problem of component selection, task assignment and task scheduling for distributed embedded computer systems. Such systems have a large number of constra...
Radoslaw Szymanek, Krzysztof Kuchcinski
ISSS
1997
IEEE
109views Hardware» more  ISSS 1997»
15 years 5 months ago
Reducing the Complexity of ILP Formulations for Synthesis
Integer Linear Programming ILP is commonly used in high level and system level synthesis. It is an NP-Complete problem in general cases. There exists some tools that give an o...
Anne Mignotte, Olivier Peyran