Sciweavers

29 search results - page 6 / 6
» Tractability in Value-based Argumentation
Sort
View
ICALP
2010
Springer
13 years 10 months ago
Parameterized Modal Satisfiability
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
Antonis Achilleos, Michael Lampis, Valia Mitsou
IROS
2009
IEEE
185views Robotics» more  IROS 2009»
14 years 3 months ago
Scalable and convergent multi-robot passive and active sensing
— A major barrier preventing the wide employment of mobile networks of robots in tasks such as exploration, mapping, surveillance, and environmental monitoring is the lack of efï...
Elias B. Kosmatopoulos, Lefteris Doitsidis, Konsta...
ICDT
2010
ACM
141views Database» more  ICDT 2010»
14 years 20 days ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller
JMLR
2010
105views more  JMLR 2010»
13 years 3 months ago
Collective Inference for Extraction MRFs Coupled with Symmetric Clique Potentials
Many structured information extraction tasks employ collective graphical models that capture interinstance associativity by coupling them with various clique potentials. We propos...
Rahul Gupta, Sunita Sarawagi, Ajit A. Diwan