Sciweavers

288 search results - page 36 / 58
» Linearly bounded infinite graphs
Sort
View
AAAI
1996
13 years 8 months ago
A Graph-Based Method for Improving GSAT
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
Kalev Kask, Rina Dechter
CORR
2007
Springer
95views Education» more  CORR 2007»
13 years 7 months ago
Support-Graph Preconditioners for 2-Dimensional Trusses
We use support theory, in particular the fretsaw extensions of Shklarski and Toledo [ST06a], to design preconditioners for the stiffness matrices of 2-dimensional truss structure...
Samuel I. Daitch, Daniel A. Spielman
DCC
2002
IEEE
14 years 7 months ago
Zero-Error Source Coding with Maximum Distortion Criterion
Let finite source and reproduction alphabets X and Y and a distortion measure d : X ? Y [0, ) be given. We study the minimum asymptotic rate required to describe a source distrib...
Ertem Tuncel, Prashant Koulgi, Shankar L. Regunath...
GD
2008
Springer
13 years 8 months ago
Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints
In this paper we present a generalization of the shift method algorithm [4, 6] to obtain a straight-line grid drawing of a triconnected graph, where vertex representations have a c...
Seok-Hee Hong, Martin Mader
IJRR
2010
115views more  IJRR 2010»
13 years 4 months ago
Improving the Efficiency of Clearing with Multi-agent Teams
We present an anytime algorithm for coordinating multiple autonomous searchers to find a potentially adversarial target on a graphical representation of a physical environment. Th...
Geoffrey Hollinger, Sanjiv Singh, Athanasios Kehag...