Sciweavers

2976 search results - page 429 / 596
» On the bounded integer programming
Sort
View
115
Voted
SAC
2010
ACM
15 years 9 months ago
Polytope-based computation of polynomial ranges
Polynomial ranges are commonly used for numerically solving polynomial systems with interval Newton solvers. Often ranges are computed using the convex hull property of the tensor...
Christoph Fünfzig, Dominique Michelucci, Sebt...
130
Voted
SIGECOM
2009
ACM
110views ECommerce» more  SIGECOM 2009»
15 years 9 months ago
On random sampling auctions for digital goods
In the context of auctions for digital goods, an interesting Random Sampling Optimal Price auction (RSOP) has been proposed by Goldberg, Hartline and Wright; this leads to a truth...
Saeed Alaei, Azarakhsh Malekian, Aravind Srinivasa...
PODS
2000
ACM
137views Database» more  PODS 2000»
15 years 6 months ago
Query Containment for Data Integration Systems
The problem of query containment is fundamental to many aspects of database systems, including query optimization, determining independence of queries from updates, and rewriting ...
Todd D. Millstein, Alon Y. Levy, Marc Friedman
ISCI
2008
145views more  ISCI 2008»
15 years 2 months ago
Aggregation in sensor networks with a user-provided quality of service goal
Significant research has been devoted to aggregation in sensor networks with a view to optimize its performance. Existing research has mostly concentrated on maximizing network li...
Zhen He, Byung Suk Lee, Xiaoyang Sean Wang
97
Voted
SIAMJO
2008
72views more  SIAMJO 2008»
15 years 2 months ago
A Sample Approximation Approach for Optimization with Probabilistic Constraints
We study approximations of optimization problems with probabilistic constraints in which the original distribution of the underlying random vector is replaced with an empirical dis...
James Luedtke, Shabbir Ahmed