Sciweavers

660 search results - page 91 / 132
» Hybrid CSP Solving
Sort
View
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
12 years 14 days ago
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
Aditya Bhaskara, Moses Charikar, Aravindan Vijayar...
AB
2007
Springer
14 years 4 months ago
Algorithmic Algebraic Model Checking IV: Characterization of Metabolic Networks
A series of papers, all under the title of Algorithmic Algebraic Model Checking (AAMC), has sought to combine techniques from algorithmic algebra, model checking and dynamical syst...
Venkatesh Mysore, Bud Mishra
CDC
2008
IEEE
129views Control Systems» more  CDC 2008»
14 years 1 days ago
Observer-based control of discrete-time piecewise affine systems: Exploiting continuity twice
Output-based feedback control of discrete-time hybrid systems is an important problem, as in practice it is rarely the case that the full state variable is available for feedback. ...
Maurice Heemels, Mircea Lazar, Nathan van de Wouw,...
JSAT
2008
99views more  JSAT 2008»
13 years 10 months ago
A Switching Criterion for Intensification and Diversification in Local Search for SAT
We propose a new switching criterion, namely the evenness or unevenness of the distribution of variable weights, and use this criterion to combine intensification and diversificat...
Wanxia Wei, Chu Min Li, Harry Zhang
HYBRID
2010
Springer
14 years 4 months ago
Real-time scheduling of mixture-of-experts systems with limited resources
Mixture-of-Experts (MoE) systems solve intricate problems by combining results generated independently by multiple computational models (the “experts”). Given an instance of a...
Prapaporn Rattanatamrong, José A. B. Fortes