Sciweavers

3591 search results - page 211 / 719
» Typing linear constraints
Sort
View
ISSS
1997
IEEE
109views Hardware» more  ISSS 1997»
15 years 11 months ago
Reducing the Complexity of ILP Formulations for Synthesis
Integer Linear Programming ILP is commonly used in high level and system level synthesis. It is an NP-Complete problem in general cases. There exists some tools that give an o...
Anne Mignotte, Olivier Peyran
DISOPT
2008
93views more  DISOPT 2008»
15 years 7 months ago
Exploiting planarity in separation routines for the symmetric traveling salesman problem
At present, the most successful approach to solving large-scale instances of the Symmetric Traveling Salesman Problem to optimality is branch-and-cut. The success of branch-and-cu...
Adam N. Letchford, Nicholas A. Pearson
CDC
2009
IEEE
118views Control Systems» more  CDC 2009»
15 years 12 months ago
Nash equilibrium problems with congestion costs and shared constraints
Abstract— Generalized Nash equilibria (GNE) represent extensions of the Nash solution concept when agents have shared strategy sets. This generalization is particularly relevant ...
Huibing Yin, Uday V. Shanbhag, Prashant G. Mehta
IJCAI
2007
15 years 8 months ago
A Theoretical Framework for Learning Bayesian Networks with Parameter Inequality Constraints
The task of learning models for many real-world problems requires incorporating domain knowledge into learning algorithms, to enable accurate learning from a realistic volume of t...
Radu Stefan Niculescu, Tom M. Mitchell, R. Bharat ...
WCRE
2007
IEEE
16 years 1 months ago
Discovering the Objectual Meaning of Foreign Key Constraints in Enterprise Applications
The software industry is increasingly confronted with the issues of understanding and maintaining a special type of object-oriented systems, namely enterprise applications. A spec...
Cristina Marinescu