Sciweavers

331 search results - page 3 / 67
» Using Redundant Constraints for Refinement
Sort
View
TACAS
2009
Springer
144views Algorithms» more  TACAS 2009»
14 years 4 days ago
Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints
Abstract. We present a method which computes optimized representations for non-convex polyhedra. Our method detects so-called redundant linear constraints in these representations ...
Christoph Scholl, Stefan Disch, Florian Pigorsch, ...
WIOPT
2010
IEEE
13 years 5 months ago
Delay efficient scheduling via redundant constraints in multihop networks
Abstract--We consider the problem of delay-efficient scheduling in general multihop networks. While the class of max-weight type algorithms are known to be throughput optimal for t...
Longbo Huang, Michael J. Neely
QSIC
2008
IEEE
14 years 2 months ago
Using Machine Learning to Refine Black-Box Test Specifications and Test Suites
In the context of open source development or software evolution, developers are often faced with test suites which have been developed with no apparent rationale and which may nee...
Lionel C. Briand, Yvan Labiche, Zaheer Bawar
CIKM
1997
Springer
13 years 11 months ago
An Analysis of Cardinality Constraints in Redundant Relationships
In this paper, we present a complete analysis of redundant relationships in the entity-relationship model. Existing approaches use the concept of functional dependencies for ident...
James Dullea, Il-Yeol Song
IJCAI
2001
13 years 9 months ago
Refining the Basic Constraint Propagation Algorithm
Constraint propagation is the main feature of any constraint solver. This is thus of prime importance to manage constraint propagation as efficiently as possible, justifying the us...
Christian Bessière, Jean-Charles Rég...