9842 search results - page 1700 / 1969 » Problem complexity |
157
click to vote
ENTCS
2007
15 years 6 months ago
2007
The event B method provides a general framework for modelling both data structures and algorithms. B models are validated by discharging proof obligations ensuring safety properti...
186
click to vote
ML
2008
ACM
15 years 6 months ago
2008
ACM
Abstract We present a new margin-based approach to first-order rule learning. The approach addresses many of the prominent challenges in first-order rule learning, such as the comp...
187
click to vote
JSAC
2006
15 years 6 months ago
2006
In this paper we address the problem of robustly estimating the position of randomly deployed nodes of a Wireless Sensor Network (WSN), in the presence of security threats. We prop...
161
click to vote
FMSD
2007
15 years 6 months ago
2007
Real-time embedded systems are often specified as a collection of independent tasks, each generating a sequence of event-triggered code blocks, and the scheduling in this domain ...
165
click to vote
MP
2006
15 years 6 months ago
2006
Abstract. Traditional stochastic programming is risk neutral in the sense that it is concerned with the optimization of an expectation criterion. A common approach to addressing ri...