1554 search results - page 192 / 311 » Parameterized Complexity and Approximation Algorithms |
128
click to vote
ANTS
2000
Springer
15 years 7 months ago
2000
Springer
This paper analyzes reduction of fractional ideals in a purely cubic function field of unit rank one. The algorithm is used for generating all the reduced principal fractional ide...
121
click to vote
SMA
2006
ACM
15 years 9 months ago
2006
ACM
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
143
click to vote
INFORMATICALT
2010
14 years 10 months ago
2010
Abstract. In stochastic programming and decision analysis, an important issue consists in the approximate representation of the multidimensional stochastic underlying process in th...
121
click to vote
INFOCOM
2010
IEEE
15 years 1 months ago
2010
IEEE
—We consider a widely applicable model of resource allocation where two sequences of events are coupled: on a continuous time axis (t), network dynamics evolve over time. On a di...
199
click to vote
CAV
2003
Springer
15 years 7 months ago
2003
Springer
odular Abstraction Refinement Thomas A. Henzinger1 , Ranjit Jhala1 , Rupak Majumdar1 , and Shaz Qadeer2 1 University of California, Berkeley 2 Microsoft Research, Redmond Abstract....