Sciweavers

942 search results - page 28 / 189
» Cooperating Constraint Solvers
Sort
View
CP
2005
Springer
14 years 27 days ago
Allocation and Scheduling for MPSoCs via Decomposition and No-Good Generation
This paper describes an efficient, complete approach for solving a complex allocation and scheduling problem for Multi-Processor System-on-Chip (MPSoC). Given a throughput constra...
Luca Benini, Davide Bertozzi, Alessio Guerri, Mich...
ICCAD
2007
IEEE
86views Hardware» more  ICCAD 2007»
14 years 4 months ago
Stimulus generation for constrained random simulation
Constrained random simulation is the main workhorse in today’s hardware verification flows. It requires the random generation of input stimuli that obey a set of declaratively...
Nathan Kitchen, Andreas Kuehlmann
ISSRE
2007
IEEE
13 years 9 months ago
Improving Constraint-Based Testing with Dynamic Linear Relaxations
Constraint-Based Testing (CBT) is the process of generating test cases against a testing objective by using constraint solving techniques. In CBT, testing objectives are given und...
Tristan Denmat, Arnaud Gotlieb, Mireille Ducass&ea...
TWC
2011
291views more  TWC 2011»
13 years 2 months ago
On Optimal Cooperator Selection Policies for Multi-Hop Ad Hoc Networks
Abstract—In this paper we consider wireless cooperative multihop networks, where nodes that have decoded the message at the previous hop cooperate in the transmission toward the ...
Michele Rossi, Cristiano Tapparello, Stefano Tomas...
CPAIOR
2008
Springer
13 years 9 months ago
Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver
Abstract. The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, b...
Alex S. Fukunaga