Sciweavers

365 search results - page 3 / 73
» Solving the Multiplication Constraint in Several Approximati...
Sort
View
ARITH
2007
IEEE
14 years 1 months ago
Solving Constraints on the Intermediate Result of Decimal Floating-Point Operations
The draft revision of the IEEE Standard for FloatingPoint Arithmetic (IEEE P754) includes a definition for decimal floating-point (FP) in addition to the widely used binary FP s...
Merav Aharoni, Ron Maharik, Abraham Ziv
CORR
2002
Springer
102views Education» more  CORR 2002»
13 years 7 months ago
Tight Approximation Results for General Covering Integer Programs
In this paper we study approximation algorithms for solving a general covering integer program. An
Stavros G. Kolliopoulos, Neal E. Young
KBSE
2010
IEEE
13 years 6 months ago
Solving string constraints lazily
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent ...
Pieter Hooimeijer, Westley Weimer
SSDBM
2003
IEEE
96views Database» more  SSDBM 2003»
14 years 23 days ago
Space Constrained Selection Problems for Data Warehouses and Pervasive Computing
Space constrained optimization problems arise in a multitude of important applications such as data warehouses and pervasive computing. A typical instance of such problems is to s...
Themistoklis Palpanas, Nick Koudas, Alberto O. Men...
UAI
2008
13 years 9 months ago
Partitioned Linear Programming Approximations for MDPs
Approximate linear programming (ALP) is an efficient approach to solving large factored Markov decision processes (MDPs). The main idea of the method is to approximate the optimal...
Branislav Kveton, Milos Hauskrecht