We briefly overview the most recent improvements we have incorporated to the existent implementations of the TAS methodology, the simplified ∆-tree representation of formulas i...
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Hua...
Planning as Satisfiability is one of the most well-known and effective techniques for classical planning: satplan has been the winning system in the deterministic track for optim...
Social navigation is the alternative way of looking upon navigation in the virtual world: e g instead of navigating the web by maps and hierarchies and search engines, you would n...