Sciweavers

3913 search results - page 159 / 783
» complexity 2006
Sort
View
LOGCOM
2002
100views more  LOGCOM 2002»
15 years 3 months ago
Model Checking Games for Branching Time Logics
This paper defines and examines model checking games for the branching time temporal logic CTL . The games employ a technique called focus which enriches sets by picking out one d...
Martin Lange, Colin Stirling
JDA
2006
106views more  JDA 2006»
15 years 4 months ago
An optimal algorithm to generate tilings
We produce an algorithm that is optimal with respect to both space and execution time to generate all the lozenge (or domino) tilings of a hole-free, general-shape domain given as...
Sébastien Desreux, Eric Rémila
JSAT
2006
94views more  JSAT 2006»
15 years 4 months ago
A Note on the Use of Independent Sets for the k-SAT Problem
An independent set of variables is one in which no two variables occur in the same clause in a given k-SAT instance. Recently, independent sets have obtained more attention. Due t...
Konstantin Kutzkov
JUCS
2000
135views more  JUCS 2000»
15 years 3 months ago
The Price of Routing in FPGAs
: Studying the architectural evolution of mainstream field programmable gate arrays (FPGAs) leads to the following remark: in these circuits, the proportion of silicon devoted to r...
Florent de Dinechin
SIBGRAPI
2006
IEEE
15 years 10 months ago
Plausible Image Based Soft Shadows Using Occlusion Textures
This paper presents a novel image-based approach to render plausible soft shadows for complex dynamic scenes with rectangular light sources. The algorithm's performance is mo...
Elmar Eisemann, Xavier Décoret