Sciweavers

13376 search results - page 188 / 2676
» Problem Solving with
Sort
View
ISPD
2006
ACM
68views Hardware» more  ISPD 2006»
15 years 9 months ago
Solving hard instances of floorplacement
Physical Design of modern systems on chip is extremely challenging. Such digital integrated circuits often contain tens of millions of logic gates, intellectual property blocks, e...
Aaron N. Ng, Igor L. Markov, Rajat Aggarwal, Venky...
IPPS
1998
IEEE
15 years 7 months ago
A Parallel Evolutionary Algorithm for the Vehicle Routing Problem with Heterogeneous Fleet
Abstract. Nowadays genetic algorithms stand as a trend to solve NPcomplete and NP-hard problems. In this paper, we present a new hybrid metaheuristic which uses Parallel Genetic Al...
Luiz Satoru Ochi, Dalessandro Soares Vianna, L&uac...
135
Voted
CORR
2006
Springer
95views Education» more  CORR 2006»
15 years 3 months ago
SAT Solving for Argument Filterings
Abstract. This paper introduces a propositional encoding for lexicographic path orders in connection with dependency pairs. This facilitates the application of SAT solvers for term...
Michael Codish, Peter Schneider-Kamp, Vitaly Lagoo...
JAL
2008
74views more  JAL 2008»
15 years 3 months ago
Solving satisfiability in the tile assembly model with a constant-size tileset
Biological systems are far more complex and robust than systems we can engineer today. One way to increase the complexity and robustness of our engineered systems is to study how ...
Yuriy Brun
IJAC
2007
59views more  IJAC 2007»
15 years 3 months ago
Polynomial-Time Complexity for Instances of the Endomorphism Problem in Free Groups
Abstract. We say the endomorphism problem is solvable for an element W in a free group F if it can be decided effectively whether, given U in F , there is an endomorphism φ of F ...
Laura Ciobanu