Sciweavers

86 search results - page 8 / 18
» Polynomial Constraints for Sets with Cardinality Bounds
Sort
View
101
Voted
ANOR
2011
117views more  ANOR 2011»
14 years 3 months ago
A simple and effective algorithm for the MaxMin diversity problem
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
Daniel Cosmin Porumbel, Jin-Kao Hao, Fred Glover
AAAI
2006
15 years 1 months ago
A BDD-Based Polytime Algorithm for Cost-Bounded Interactive Configuration
Interactive configurators are decision support systems assisting users in selecting values for parameters that respect given constraints. The underlying knowledge can be convenien...
Tarik Hadzic, Henrik Reif Andersen
94
Voted
STOC
1993
ACM
123views Algorithms» more  STOC 1993»
15 years 3 months ago
Constructing small sample spaces satisfying given constraints
Abstract. The subject of this paper is nding small sample spaces for joint distributions of n discrete random variables. Such distributions are often only required to obey a certa...
Daphne Koller, Nimrod Megiddo
112
Voted
CAV
2008
Springer
161views Hardware» more  CAV 2008»
15 years 1 months ago
Constraint-Based Approach for Analysis of Hybrid Systems
Abstract. This paper presents a constraint-based technique for discovering a rich class of inductive invariants (boolean combinations of polynomial inequalities of bounded degree) ...
Sumit Gulwani, Ashish Tiwari
ICALP
2001
Springer
15 years 4 months ago
Approximation Algorithms for Partial Covering Problems
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
Rajiv Gandhi, Samir Khuller, Aravind Srinivasan