Sciweavers

5331 search results - page 652 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
CPAIOR
2010
Springer
15 years 11 months ago
Upper Bounds on the Number of Solutions of Binary Integer Programs
We present a new method to compute upper bounds of the number of solutions of binary integer programming (BIP) problems. Given a BIP, we create a dynamic programming (DP) table for...
Siddhartha Jain, Serdar Kadioglu, Meinolf Sellmann
161
Voted
GESELLSCHAFT
1993
15 years 11 months ago
Phasenmodell ist OUT - Benutzerbeteiligung jetzt auch bei Standardsoftware-Entwicklung
The current state of traditional software development is surveyed and essential problems are investigated on the basis of system theoretical considerations. The concept of user pa...
Matthias Rauterberg, Raimund Mollenhauer, Philipp ...
WADS
1995
Springer
107views Algorithms» more  WADS 1995»
15 years 10 months ago
Quadrangulations of Planar Sets
We consider the problem of obtaining “nice” quadrangulations of planar sets of points. For many applications “nice” means that the quadrilaterals obtained are convex if po...
Godfried T. Toussaint
ASPDAC
2005
ACM
114views Hardware» more  ASPDAC 2005»
15 years 8 months ago
Redundant-via enhanced maze routing for yield improvement
- Redundant via insertion is a good solution to reduce the yield loss by via failure. However, the existing methods are all post-layout optimizations that insert redundant via afte...
Gang Xu, Li-Da Huang, David Z. Pan, Martin D. F. W...
183
Voted
NIPS
2000
15 years 8 months ago
Improved Output Coding for Classification Using Continuous Relaxation
Output coding is a general method for solving multiclass problems by reducing them to multiple binary classification problems. Previous research on output coding has employed, alm...
Koby Crammer, Yoram Singer