Sciweavers

940 search results - page 87 / 188
» Local rely-guarantee reasoning
Sort
View
109
Voted
AAAI
2008
15 years 3 months ago
Partially Synchronized DEC-MDPs in Dynamic Mechanism Design
In this paper, we combine for the first time the methods of dynamic mechanism design with techniques from decentralized decision making under uncertainty. Consider a multi-agent s...
Sven Seuken, Ruggiero Cavallo, David C. Parkes
89
Voted
EMNLP
2008
15 years 2 months ago
Jointly Combining Implicit Constraints Improves Temporal Ordering
Previous work on ordering events in text has typically focused on local pairwise decisions, ignoring globally inconsistent labels. However, temporal ordering is the type of domain...
Nathanael Chambers, Daniel Jurafsky
AAAI
1992
15 years 1 months ago
On the Minimality and Decomposability of Constraint Networks
Constraint networks have been shown to be useful in formulating such diverse problems as scene labeling, natural language parsing, and temporal reasoning. Given a constraint netwo...
Peter van Beek
CORR
2008
Springer
76views Education» more  CORR 2008»
15 years 23 days ago
Constraint Complexity of Realizations of Linear Codes on Arbitrary Graphs
ABSTRACT. A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces...
Navin Kashyap
85
Voted
SIAMJO
2002
77views more  SIAMJO 2002»
15 years 10 days ago
Modifying SQP for Degenerate Problems
Most local convergence analyses of the sequential quadratic programming (SQP) algorithm for nonlinear programming make strong assumptions about the solution, namely, that the activ...
Stephen J. Wright