2976 search results - page 237 / 596 » On the bounded integer programming |
183
Voted
RTSS
2009
IEEE
16 years 26 days ago
2009
IEEE
—Memory accesses form an important source of timing unpredictability. Timing analysis of real-time embedded software thus requires bounding the time for memory accesses. Multipro...
161
click to vote
ESOP
2011
Springer
14 years 9 months ago
2011
Springer
Abstract. Nominal Isabelle is a definitional extension of the Isabelle/HOL theorem prover. It provides a proving infrastructure for reasoning about programming language calculi in...
161
Voted
LPNMR
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We present a logic programming based conditional planner that is capable of generating both conditional and sequential conformant plans in the presence of sensing actions...
151
click to vote
NIPS
2008
15 years 7 months ago
2008
This paper examines the generalization properties of online convex programming algorithms when the loss function is Lipschitz and strongly convex. Our main result is a sharp bound...
162
click to vote
AUTOMATICA
2005
15 years 6 months ago
2005
This paper presents novel analysis results for input-to-state stability (ISS) that utilise dynamic programming techniques to characterise minimal ISS gains and transient bounds. Th...