Sciweavers

1968 search results - page 92 / 394
» The Complexity of Valued Constraint Models
Sort
View
133
Voted
AUTOMATICA
2007
111views more  AUTOMATICA 2007»
15 years 4 months ago
A stable block model predictive control with variable implementation horizon
— In this paper, we present a stable receding horizon model predictive control for discrete-time nonlinear systems. The standard MPC scheme is modified to incorporate (1) a bloc...
Jing Sun, Ilya V. Kolmanovsky, Reza Ghaemi, Shuhao...
FOCS
2009
IEEE
15 years 10 months ago
The Complexity of Rationalizing Network Formation
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
Shankar Kalyanaraman, Christopher Umans
DEXAW
1999
IEEE
137views Database» more  DEXAW 1999»
15 years 8 months ago
Reasoning with Enhanced Temporal Entity-Relationship Models
Recent efforts in the Conceptual Modelling community have been devoted to properly capturing time-varying information, and several proposals of temporally enhanced Entity-Relation...
Alessandro Artale, Enrico Franconi
CP
2007
Springer
15 years 10 months ago
Reformulating CSPs for Scalability with Application to Geospatial Reasoning
While many real-world combinatorial problems can be advantageously modeled and solved using Constraint Programming, scalability remains a major issue in practice. Constraint models...
Kenneth M. Bayer, Martin Michalowski, Berthe Y. Ch...
SEMCO
2007
IEEE
15 years 10 months ago
Modeling Discriminative Global Inference
Many recent advances in complex domains such as Natural Language Processing (NLP) have taken a discriminative approach in conjunction with the global application of structural and...
Nicholas Rizzolo, Dan Roth