9532 search results - page 181 / 1907 » Logic, Graphs, and Algorithms |
159
click to vote
JSAT
2008
15 years 4 months ago
2008
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
142
click to vote
ECCV
2006
Springer
16 years 6 months ago
2006
Springer
Algorithms for discrete energy minimization play a fundamental role for low-level vision. Known techniques include graph cuts, belief propagation (BP) and recently introduced tree-...
120
click to vote
ISCAPDCS
2007
15 years 5 months ago
2007
With rapid increase of parallel computation systems in their sizes, it is inevitable to develop algorithms that are applicable even if there exist faulty elements in the systems. ...
125
click to vote
ICCAD
1999
IEEE
15 years 8 months ago
1999
IEEE
Abstract-- ECO routing is a very important design capability in advanced IC, MCM and PCB designs when additional routings need to be made at the latter stage of the physical design...
123
click to vote
WG
2007
Springer
15 years 10 months ago
2007
Springer
The pathwidth of a graph G is the minimum clique number of H minus one, over all interval supergraphs H of G. Although pathwidth is a well-known and well-studied graph parameter, t...