2485 search results - page 108 / 497 » Time Bounded Frequency Computations |
139
click to vote
DALT
2005
Springer
15 years 10 months ago
2005
Springer
Agents need to be able to change their beliefs; in particular, they should be able to contract or remove a certain belief in order to restore consistency to their set of beliefs, a...
135
click to vote
FDTC
2006
Springer
15 years 8 months ago
2006
Springer
With physical attacks threatening the security of current cryptographic schemes, no security policy can be developed without taking into account the physical nature of computation....
255
click to vote
EMMCVPR
2011
Springer
14 years 4 months ago
2011
Springer
In this work, we are concerned with the detection of multiple objects in an image. We demonstrate that typically applied objectives have the structure of a random field model, but...
152
click to vote
RTAS
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract—Real-time systems on non-preemptive platforms require a means of bounding the execution time of programs for admission purposes. Worst-Case Execution Time (WCET) is most...
130
click to vote
DAM
2006
15 years 4 months ago
2006
We address the classical knapsack problem and a variant in which an upper bound is imposed on the number of items that can be selected. We show that appropriate combinations of ro...