Sciweavers

193 search results - page 15 / 39
» A Tractable Class of Abduction Problems
Sort
View
ASWC
2009
Springer
15 years 24 days ago
Reasoning about Partially Ordered Web Service Activities in PSL
Many tasks within semantic web service discovery can be formalized as reasoning problems related to the partial ordering of subactivity occurrences in a complex activity. We show h...
Michael Gruninger, Xing Tan
AAAI
2012
12 years 12 months ago
Competing with Humans at Fantasy Football: Team Formation in Large Partially-Observable Domains
We present the first real-world benchmark for sequentiallyoptimal team formation, working within the framework of a class of online football prediction games known as Fantasy Foo...
Tim Matthews, Sarvapali D. Ramchurn, Georgios Chal...
FLAIRS
2004
14 years 11 months ago
Package Planning with Graphical Models
We consider a novel class of applications where a set of activities conducted by a group of people over a time period needs to be planned, taking into account each member's p...
Yang Xiang, Michael Janzen
93
Voted
COCO
2003
Springer
114views Algorithms» more  COCO 2003»
15 years 2 months ago
Bounded Nondeterminism and Alternation in Parameterized Complexity Theory
We give machine characterisations and logical descriptions of a number of parameterized complexity classes. The focus of our attention is the class W[P], which we characterise as ...
Yijia Chen, Jörg Flum, Martin Grohe
168
Voted
DISOPT
2011
240views Education» more  DISOPT 2011»
14 years 4 months ago
On the directed Full Degree Spanning Tree problem
We study the parameterized complexity of a directed analog of the Full Degree Spanning Tree problem where, given a digraph D and a nonnegative integer k, the goal is to construct a...
Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh,...