11397 search results - page 1940 / 2280 » A Relational Abstraction for Functions |
188
click to vote
IJRR
2011
15 years 2 months ago
2011
We present a novel approach to legged locomotion over rough terrain that is thoroughly rooted in optimization. This approach relies on a hierarchy of fast, anytime algorithms to p...
190
click to vote
SIAMDM
2011
15 years 2 months ago
2011
Abstract. A generalized Davenport–Schinzel sequence is one over a finite alphabet that excludes subsequences isomorphic to a fixed forbidden subsequence. The fundamental proble...
194
click to vote
SIAMJO
2011
15 years 2 months ago
2011
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...
242
click to vote
TDSC
2011
15 years 2 months ago
2011
Abstract— We present on-line tunable diagnostic and membership protocols for generic time-triggered (TT) systems to detect crashes, send/receive omission faults and network parti...
213
click to vote
TIT
2011
15 years 2 months ago
2011
Abstract—This work addresses the computational complexity of achieving the capacity of a general network coding instance. We focus on the linear capacity, namely the capacity of ...