Sciweavers

364 search results - page 15 / 73
» Generalized normal forms and polynomial system solving
Sort
View
ATAL
2006
Springer
15 years 10 months ago
Forming efficient agent groups for completing complex tasks
In this paper we produce complexity and impossibility results and develop algorithms for a task allocation problem that needs to be solved by a group of autonomous agents working ...
Efrat Manisterski, Esther David, Sarit Kraus, Nich...
IS
2010
15 years 4 months ago
Extracting a largest redundancy-free XML storage structure from an acyclic hypergraph in polynomial time
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
Wai Yin Mok, Joseph Fong, David W. Embley
BIRTHDAY
2009
Springer
16 years 1 months ago
Polynomial Precise Interval Analysis Revisited
We consider a class of arithmetic equations over the complete lattice of integers (extended with −∞ and ∞) and provide a polynomial time algorithm for computing least solutio...
Thomas Gawlitza, Jérôme Leroux, Jan R...
ACL
2004
15 years 7 months ago
Generalized Multitext Grammars
Generalized Multitext Grammar (GMTG) is a synchronous grammar formalism that is weakly equivalent to Linear Context-Free Rewriting Systems (LCFRS), but retains much of the notatio...
I. Dan Melamed, Giorgio Satta, Benjamin Wellington
EUROPAR
2003
Springer
15 years 11 months ago
Parallel ScaLAPACK-Style Algorithms for Solving Continuous-Time Sylvester Matrix Equations
An implementation of a parallel ScaLAPACK-style solver for the general Sylvester equation, op(A)X −Xop(B) = C, where op(A) denotes A or its transpose AT , is presented. The paral...
Robert Granat, Bo Kågström, Peter Porom...