Sciweavers

427 search results - page 25 / 86
» A Graph Based Synthesis Algorithm for Solving CSPs
Sort
View
CGF
2006
132views more  CGF 2006»
13 years 7 months ago
Verification of Physically Based Rendering Algorithms
Within computer graphics, the field of predictive rendering is concerned with those methods of image synthesis which yield results that do not only look real, but are also radiome...
Christiane Ulbricht, Alexander Wilkie, Werner Purg...
ICCAD
2010
IEEE
140views Hardware» more  ICCAD 2010»
13 years 5 months ago
Reduction of interpolants for logic synthesis
Craig Interpolation is a state-of-the-art technique for logic synthesis and verification, based on Boolean Satisfiability (SAT). Leveraging the efficacy of SAT algorithms, Craig In...
John D. Backes, Marc D. Riedel
DAC
2005
ACM
14 years 8 months ago
Efficient SAT solving: beyond supercubes
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
Domagoj Babic, Jesse D. Bingham, Alan J. Hu
ATAL
2009
Springer
14 years 2 months ago
Solving multiagent assignment Markov decision processes
We consider the setting of multiple collaborative agents trying to complete a set of tasks as assigned by a centralized controller. We propose a scalable method called“Assignmen...
Scott Proper, Prasad Tadepalli
SAT
2005
Springer
133views Hardware» more  SAT 2005»
14 years 1 months ago
Solving Over-Constrained Problems with SAT Technology
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...
Josep Argelich, Felip Manyà