559 search results - page 99 / 112 » Fast SDP Algorithms for Constraint Satisfaction Problems |
AAAI
1996
13 years 10 months ago
1996
Arc consistency filtering is widely used in the framework of binary constraint satisfaction problems: with a low complexity, inconsistency may be detected,and domains are filtered...
WCRE
2002
IEEE
14 years 1 months ago
2002
IEEE
Dynamic binary translators compile machine code from a source architecture to a target architecture at run time. Due to the hard time constraints of just-in-time compilation only ...
CDC
2008
IEEE
14 years 3 months ago
2008
IEEE
Abstract— In this paper we demonstrate how one can reformulate the MPC problem for LPV systems to a series of mpLPs by a closed-loop minimax MPC algorithm based on dynamic progra...
JALC
2006
13 years 8 months ago
2006
Automated Web Service Composition has gained a significant momentum in facilitating fast and efficient formation of business-to-business collaborations where an important objectiv...
STOC
2010
ACM
14 years 18 days ago
2010
ACM
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...