Sciweavers

541 search results - page 9 / 109
» Factoring Solution Sets of Polynomial Systems in Parallel
Sort
View
IPPS
2000
IEEE
14 years 2 months ago
Heuristic Solutions for a Mapping Problem in a TV-Anytime Server Network
This paper presents a novel broadband multimedia service called TV-Anytime. The basic idea of this service is to store broadcast media assets onto media server systems and allow c...
Xiaobo Zhou, Reinhard Lüling, Li Xie
CORR
2011
Springer
155views Education» more  CORR 2011»
13 years 1 months ago
On the Generation of Positivstellensatz Witnesses in Degenerate Cases
One can reduce the problem of proving that a polynomial is nonnegative, or more generally of proving that a system of polynomial inequalities has no solutions, to finding polynomi...
David Monniaux, Pierre Corbineau
PDP
2008
IEEE
14 years 4 months ago
Scheduling of QR Factorization Algorithms on SMP and Multi-Core Architectures
This paper examines the scalable parallel implementation of QR factorization of a general matrix, targeting SMP and multi-core architectures. Two implementations of algorithms-by-...
Gregorio Quintana-Ortí, Enrique S. Quintana...
COCOON
2005
Springer
14 years 3 months ago
Interference in Cellular Networks: The Minimum Membership Set Cover Problem
Abstract. The infrastructure for mobile distributed tasks is often formed by cellular networks. One of the major issues in such networks is interference. In this paper we tackle in...
Fabian Kuhn, Pascal von Rickenbach, Roger Wattenho...
AIPS
2010
13 years 12 months ago
Cost-Optimal Factored Planning: Promises and Pitfalls
Factored planning methods aim to exploit locality to efficiently solve large but "loosely coupled" planning problems by computing solutions locally and propagating limit...
Eric Fabre, Loig Jezequel, Patrik Haslum, Sylvie T...