Sciweavers

367 search results - page 64 / 74
» A memetic algorithm for graph coloring
Sort
View
ISMVL
2006
IEEE
109views Hardware» more  ISMVL 2006»
14 years 1 months ago
Towards Solving Many-Valued MaxSAT
We define the MaxSAT problem for many-valued CNF formulas, called many-valued MaxSAT, and establish its complexity class. We then describe a basic branch and bound algorithm for ...
Josep Argelich, Xavier Domingo, Chu Min Li, Felip ...
FPL
2001
Springer
107views Hardware» more  FPL 2001»
14 years 1 days ago
Gambit: A Tool for the Simultaneous Placement and Detailed Routing of Gate-Arrays
In this paper we present a new method of integrating the placement and routing stages in the physical design of channel-based architectures, and present the first implementation o...
John Karro, James P. Cohoon
INTEGRATION
2006
102views more  INTEGRATION 2006»
13 years 7 months ago
A parameterized graph-based framework for high-level test synthesis
Improving testability during the early stages of high-level synthesis has several benefits including reduced test hardware overheads, reduced test costs, reduced design iterations...
Saeed Safari, Amir-Hossein Jahangir, Hadi Esmaeilz...
CORR
2007
Springer
147views Education» more  CORR 2007»
13 years 7 months ago
Decomposition During Search for Propagation-Based Constraint Solvers
Abstract. We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically ...
Martin Mann, Guido Tack, Sebastian Will
PRL
2007
146views more  PRL 2007»
13 years 7 months ago
Neighbor number, valley seeking and clustering
This paper proposes a novel nonparametric clustering algorithm capable of identifying shape-free clusters. This algorithm is based on a nonparametric estimation of the normalized ...
Chaolin Zhang, Xuegong Zhang, Michael Q. Zhang, Ya...