Sciweavers

606 search results - page 100 / 122
» Answer Diversification for Complex Question Answering on the...
Sort
View
ISCAS
2003
IEEE
124views Hardware» more  ISCAS 2003»
15 years 5 months ago
Convergent transfer subgraph characterization and computation
In this paper, we present a precise characterization of the existence of a convergent transfer subgraph in an edge colored directed acyclic graph. Based on the characterization, l...
Wing Ning Li
COCO
2008
Springer
88views Algorithms» more  COCO 2008»
15 years 1 months ago
Approximation of Natural W[P]-Complete Minimisation Problems Is Hard
We prove that the weighted monotone circuit satisfiability problem has no fixed-parameter tractable approximation algorithm with constant or polylogarithmic approximation ratio un...
Kord Eickmeyer, Martin Grohe, Magdalena Grübe...
CPHYSICS
2004
85views more  CPHYSICS 2004»
14 years 11 months ago
Beyond benchmarking - how experiments and simulations can work together in plasma physics
There has been dramatic progress in the scope and power of plasma simulations in recent years; and because codes are generally cheaper to write, to run and to diagnose than experi...
Martin Greenwald
IGPL
1998
97views more  IGPL 1998»
14 years 11 months ago
Towards Structurally-Free Theorem Proving
Is it possible to compute in which logics a given formula is deducible? The aim of this paper is to provide a formal basis to answer positively this question in the context of sub...
Marcelo Finger
TCS
2002
14 years 11 months ago
Set-sharing is redundant for pair-sharing
Although the usual goal of sharing analysis is to detect which pairs of variables share, the standard choice for sharing analysis is a domain that characterizes set-sharing. In th...
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella