Sciweavers

1142 search results - page 95 / 229
» Approximability of Clausal Constraints
Sort
View
CORR
2010
Springer
66views Education» more  CORR 2010»
15 years 6 months ago
A Partial Taxonomy of Substitutability and Interchangeability
Substitutability, interchangeability and related concepts in Constraint Programming were introduced approximately twenty years ago and have given rise to considerable subsequent re...
Shant Karakashian, Robert J. Woodward, Berthe Y. C...
TCAD
2008
68views more  TCAD 2008»
15 years 6 months ago
Highly Efficient Gradient Computation for Density-Constrained Analytical Placement
Abstract--Recent analytical global placers use density constraints to approximate nonoverlap constraints, and these show very successful results. This paper unifies a wide range of...
Jason Cong, Guojie Luo, Eric Radke
NETWORKS
2010
15 years 4 months ago
Network flow spanners
Abstract. In this paper, motivated by applications of ordinary (distance) spanners in communication networks and to address such issues as bandwidth constraints on network links, l...
Feodor F. Dragan, Chenyu Yan
RSS
2007
151views Robotics» more  RSS 2007»
15 years 7 months ago
An Implicit Time-Stepping Method for Multibody Systems with Intermittent Contact
— In this paper we present an implicit time-stepping scheme for multibody systems with intermittent contact by incorporating the contact constraints as a set of complementarity a...
Nilanjan Chakraborty, Stephen Berard, Srinivas Ake...
ESA
2009
Springer
109views Algorithms» more  ESA 2009»
16 years 1 months ago
Iterative Rounding for Multi-Objective Optimization Problems
In this paper we show that iterative rounding is a powerful and flexible tool in the design of approximation algorithms for multiobjective optimization problems. We illustrate tha...
Fabrizio Grandoni, R. Ravi, Mohit Singh