4117 search results - page 314 / 824 » On the Satisfiability of Complex Constraints |
189
click to vote
BROADNETS
2004
IEEE
15 years 10 months ago
2004
IEEE
In this paper, we present a framework for the design of minimal power schedulers that satisfy average packet delay bounds for multiple users in a Gaussian wireless broadcast chann...
168
click to vote
AUSAI
2006
Springer
15 years 10 months ago
2006
Springer
This paper explores logical properties of belief-revision-based bargaining solution. We first present a syntax-independent construction of bargaining solution based on prioritized ...
177
click to vote
SDM
2007
SIAM
15 years 8 months ago
2007
SIAM
We present an efficient dynamic algorithm for clustering undirected graphs, whose edge property is changing continuously. The algorithm maintains clusters of high quality in pres...
175
click to vote
APAL
1999
15 years 6 months ago
1999
We give a sound and complete propositional S5 tableau system of a particularly simple sort, having an easy completeness proof. It sheds light on why the satisfiability problem for...
159
click to vote
ICRA
2010
IEEE
15 years 5 months ago
2010
IEEE
Abstract— Many robotic control tasks involve complex dynamics that are hard to model. Hand-specifying trajectories that satisfy a system’s dynamics can be very time-consuming a...