Sciweavers

1458 search results - page 178 / 292
» The sequentially realizable functionals
Sort
View
JMIV
1998
93views more  JMIV 1998»
15 years 3 months ago
Connectivity on Complete Lattices
Classically, connectivity is a topological notion for sets, often introduced by means of arcs. A non topological axiomatics has been proposed by Matheron and Serra. The present pa...
Jean Serra
106
Voted
TKDE
1998
102views more  TKDE 1998»
15 years 3 months ago
Fast and Effective Retrieval of Medical Tumor Shapes
—We investigate the problem of retrieving similar shapes from a large database; in particular, we focus on medical tumor shapes (“Find tumors that are similar to a given patter...
Flip Korn, Nikolaos Sidiropoulos, Christos Falouts...
ICFEM
2010
Springer
15 years 2 months ago
Dynamic Resource Reallocation between Deployment Components
Abstract. Today’s software systems are becoming increasingly configurable and designed for deployment on a plethora of architectures, ranging from sequential machines via multic...
Einar Broch Johnsen, Olaf Owe, Rudolf Schlatte, Si...
TCS
2010
15 years 2 months ago
Alternating states for dual nondeterminism in imperative programming
The refinement calculus of Back, Morgan, Morris, and others is based on monotone predicate transformers (weakest preconditions) where conjunctions stand for demonic choices betwee...
Wim H. Hesselink
CDC
2010
IEEE
112views Control Systems» more  CDC 2010»
14 years 11 months ago
Online Convex Programming and regularization in adaptive control
Online Convex Programming (OCP) is a recently developed model of sequential decision-making in the presence of time-varying uncertainty. In this framework, a decisionmaker selects ...
Maxim Raginsky, Alexander Rakhlin, Serdar Yük...