Boolean satisfiability (SAT) is the canonical NP-complete problem that plays an important role in AI and has many practical applications in Computer Science in general. Boolean n...
This paper proposes a new planning architecture for agents operating in uncertain and dynamic environments. Decisiontheoretic planning has been recognized as a useful tool for rea...
We develop a dynamic, free-form surface model which is useful for representing a broad class of objects with symmetries and topological variability. The new model is based upon sw...
This paper presents an algorithm and a data structure for scalable dynamic synchronization in fine-grained parallelism. The algorithm supports the full generality of phasers with d...
Stefan Marr, Stijn Verhaegen, Bruno De Fraine, The...
Many natural scenes have a dynamic range that is larger than the dynamic range of a camera's image sensor. A popular approach to producing an image without under- and over-ex...
Natasha Gelfand, Andrew Adams, Sung Hee Park, Kari...