Sciweavers

811 search results - page 72 / 163
» Avoiding Approximate Squares
Sort
View
COCO
2005
Springer
89views Algorithms» more  COCO 2005»
14 years 1 months ago
Hardness of Max 3SAT with No Mixed Clauses
We study the complexity of approximating Max NME3SAT, a variant of Max 3SAT when the instances are guaranteed to not have any mixed clauses, i.e., every clause has either all its ...
Venkatesan Guruswami, Subhash Khot
NIPS
2001
13 years 9 months ago
Multiagent Planning with Factored MDPs
We present a principled and efficient planning algorithm for cooperative multiagent dynamic systems. A striking feature of our method is that the coordination and communication be...
Carlos Guestrin, Daphne Koller, Ronald Parr
ATVA
2010
Springer
125views Hardware» more  ATVA 2010»
13 years 8 months ago
Using Redundant Constraints for Refinement
Abstract. This paper is concerned with a method for computing reachable sets of linear continuous systems with uncertain input. Such a method is required for verification of hybrid...
Eugene Asarin, Thao Dang, Oded Maler, Romain Testy...
TVCG
2011
175views more  TVCG 2011»
13 years 2 months ago
Parallel Iteration to the Radiative Transport in Inhomogeneous Media with Bootstrapping
—This paper presents a fast parallel method to solve the radiative transport equation in inhomogeneous participating media. We apply a novel approximation scheme to find a good ...
László Szirmay-Kalos, Gabor Liktor, ...
ICASSP
2011
IEEE
12 years 11 months ago
Distributed beamforming for multiuser peer-to-peer and multi-group multicasting relay networks
We generalize the concept of multiuser peer-to-peer (MUP2P) relay networks to that of a multi-group multicasting (MGM) relay network where each source may broadcast its message to...
Nils Bornhorst, Marius Pesavento, Alex B. Gershman