Sciweavers

470 search results - page 94 / 94
» Tabu Search for SAT
Sort
View
JELIA
2004
Springer
15 years 3 months ago
tascpl: TAS Solver for Classical Propositional Logic
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...
Manuel Ojeda-Aciego, Agustín Valverde
EMSOFT
2009
Springer
15 years 2 months ago
Modular static scheduling of synchronous data-flow networks: an efficient symbolic representation
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...
Marc Pouzet, Pascal Raymond
COCO
2004
Springer
119views Algorithms» more  COCO 2004»
15 years 2 months ago
Tight Lower Bounds for Certain Parameterized NP-Hard Problems
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...
LOGCOM
2011
14 years 1 months ago
Introducing Preferences in Planning as Satisfiability
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...
Enrico Giunchiglia, Marco Maratea
MC
2003
170views Computer Science» more  MC 2003»
14 years 12 months ago
Social navigation: from the web to the mobile
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...
Kristina Höök