140 search results - page 26 / 28 » Orderings and Constraints: Theory and Practice of Proving Te... |
ISSAC
2007
Springer
14 years 3 months ago
2007
Springer
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
SIAMJO
2010
13 years 4 months ago
2010
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...
SIGCOMM
2005
ACM
14 years 3 months ago
2005
ACM
Thousands of competing autonomous systems must cooperate with each other to provide global Internet connectivity. Each autonomous system (AS) encodes various economic, business, a...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
In this paper, we propose a stochastic model to describe how search service providers charge client companies based on users' queries for the keywords related to these compan...
ESA
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...