881 search results - page 12 / 177 » Solving satisfiability problems with preferences |
JCM
2007
13 years 8 months ago
2007
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
MP
2007
13 years 8 months ago
2007
We present a practical approach to Anstreicher and Lee’s masked spectral bound for maximum-entropy sampling, and we describe favorable results that we have obtained with a Branch...
FPL
1998
Springer
14 years 25 days ago
1998
Springer
Abstract. We present different architectures to solve Boolean satisfiability problems in instance-specific hardware. A simulation of these architectures shows that for examples fro...
DATE
2010
IEEE
14 years 29 days ago
2010
IEEE
Abstract--Nowadays, modeling languages like UML are essential in the design of complex software systems and also start to enter the domain of hardware and hardware/software codesig...
AUSAI
1997
Springer
14 years 24 days ago
1997
Springer
Engineering problem solving requires both domain knowledge and an understanding of how to apply that knowledge. While much of the recent work in qualitative physics has focused on...