Sciweavers

390 search results - page 14 / 78
» Set Intersection Theorems and Existence of Optimal Solutions
Sort
View
CCIA
2009
Springer
13 years 8 months ago
Secure and Optimal Base Contraction in Graded Lukasiewicz Logics
Abstract. The operation of base contraction was successfully characterized for a very general class of logics using the notion of remainder sets. Although, in the general case, thi...
Pere Pardo, Pilar Dellunde, Lluis Godo
4OR
2010
137views more  4OR 2010»
13 years 7 months ago
Extended formulations in combinatorial optimization
This survey is concerned with the size of perfect formulations for combinatorial optimization problems. By "perfect formulation", we mean a system of linear inequalities...
Michele Conforti, Gérard Cornuéjols,...
CORR
2010
Springer
148views Education» more  CORR 2010»
13 years 7 months ago
Perturbation Resilience and Superiorization of Iterative Algorithms
Iterative algorithms aimed at solving some problems are discussed. For certain problems, such as finding a common point in the intersection of a finite number of convex sets, there...
Yair Censor, R. Davidi, Gabor T. Herman
DAC
2000
ACM
14 years 8 months ago
Depth optimal incremental mapping for field programmable gate arrays
In this paper, we study the incremental t echnology mapping problem for lookup-table (LUT) based Field Programmable Gate Arrays (FPGAs) under incremental changes. Given a gate-lev...
Jason Cong, Hui Huang
SODA
1992
ACM
135views Algorithms» more  SODA 1992»
13 years 8 months ago
Applications of Parametric Searching in Geometric Optimization
We present several applications in computational geometry of Megiddo's parametric searching technique. These applications include: (1) Finding the minimum Hausdorff distance ...
Pankaj K. Agarwal, Micha Sharir, Sivan Toledo