Sciweavers

2636 search results - page 250 / 528
» Linear Programming
Sort
View
ECCC
2010
89views more  ECCC 2010»
15 years 3 months ago
Lower bounds for designs in symmetric spaces
A design is a finite set of points in a space on which every "simple" functions averages to its global mean. Illustrative examples of simple functions are low-degree pol...
Noa Eidelstein, Alex Samorodnitsky
EOR
2007
72views more  EOR 2007»
15 years 3 months ago
Placing a finite size facility with a center objective on a rectangular plane with barriers
This paper addresses the finite size 1-center placement problem on a rectangular plane in the presence of barriers. Barriers are regions in which both facility location and trave...
Avijit Sarkar, Rajan Batta, Rakesh Nagi
DBPL
1999
Springer
109views Database» more  DBPL 1999»
15 years 7 months ago
Expressing Topological Connectivity of Spatial Databases
We consider two-dimensional spatial databases defined in terms of polynomial inequalities and focus on the potential of programming languages for such databases to express queries...
Floris Geerts, Bart Kuijpers
CP
2005
Springer
15 years 8 months ago
Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
We consider the problem of encoding Boolean cardinality constraints in conjunctive normal form (CNF). Boolean cardinality constraints are formulae expressing that at most (resp. at...
Carsten Sinz
ICALP
2009
Springer
16 years 3 months ago
On a Network Generalization of the Minmax Theorem
We consider graphical games in which edges are zero-sum games between the endpoints/players; the payoff of a player is the sum of the payoffs from each incident edge. We give a si...
Constantinos Daskalakis, Christos H. Papadimitriou