Sciweavers

1522 search results - page 241 / 305
» On the Complexity of Several Haplotyping Problems
Sort
View
SIAMCOMP
2002
112views more  SIAMCOMP 2002»
14 years 9 months ago
The Efficiency of Resolution and Davis--Putnam Procedures
We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula in conjunctive normal form is satisfiable. First, build...
Paul Beame, Richard M. Karp, Toniann Pitassi, Mich...
PVLDB
2008
104views more  PVLDB 2008»
14 years 9 months ago
Scalable multi-query optimization for exploratory queries over federated scientific databases
The diversity and large volumes of data processed in the Natural Sciences today has led to a proliferation of highlyspecialized and autonomous scientific databases with inherent a...
Anastasios Kementsietsidis, Frank Neven, Dieter Va...
JAIR
2010
82views more  JAIR 2010»
14 years 8 months ago
Non-Transferable Utility Coalitional Games via Mixed-Integer Linear Constraints
Coalitional games serve the purpose of modeling payoff distribution problems in scenarios where agents can collaborate by forming coalitions in order to obtain higher worths than...
Gianluigi Greco, Enrico Malizia, Luigi Palopoli, F...
JAPLL
2010
104views more  JAPLL 2010»
14 years 8 months ago
Complete axiomatizations for XPath fragments
We provide complete axiomatizations for several fragments of XPath: sets of equivalences from which every other valid equivalence is derivable. Specifically, we axiomatize downwar...
Balder ten Cate, Tadeusz Litak, Maarten Marx
MFCS
2010
Springer
14 years 8 months ago
Proof Systems and Transformation Games
We introduce Transformation Games (TGs), a form of coalitional game in which players are endowed with sets of initial resources, and have capabilities allowing them to derive certa...
Yoram Bachrach, Michael Zuckerman, Michael Wooldri...