Results 1  10
of
3,550,816
On recent advances in time/utility function realtime scheduling and resource management
 In IEEE ISORC, pages 55 – 60
, 2005
"... We argue that the key underpinning of the current stateofthe realtime practice — the priority artifact — and that of the current stateofthe realtime art — deadlinebased timeliness optimality — are entirely inadequate for specifying timeliness objectives, for reasoning about timeliness behavior ..."
Abstract

Cited by 36 (11 self)
 Add to MetaCart
behavior, and for performing resource management that can dependably satisfy timeliness objectives in many dynamic realtime systems. We argue that time/utility functions and the utility accrual scheduling paradigm provide a more generalized, adaptive, and flexible approach. Recent research in the utility
1 Time/Utility Function Decomposition in Soft RealTime Distributed Systems
"... We consider RealTime CORBA 2.0 (Dynamic Scheduling) distributable threads, whose time constraints are specified using time/utility functions (TUFs), operating in legacy environments. In legacy environments, system node resources—both physical (processor, disk, I/O, etc.) and logical (locks, etc.)—ar ..."
Abstract
 Add to MetaCart
We consider RealTime CORBA 2.0 (Dynamic Scheduling) distributable threads, whose time constraints are specified using time/utility functions (TUFs), operating in legacy environments. In legacy environments, system node resources—both physical (processor, disk, I/O, etc.) and logical (locks, etc
Time/Utility Function Decomposition in Soft RealTime Distributed Systems
"... Abstract We consider RealTime CORBA 2.0 (Dynamic Scheduling) distributable threads, whose time constraints are specified using time/utility functions (TUFs), operating in legacy environments. In legacy environments, system node resourcesboth physical (processor, disk, I/O, etc.) and logical (locks ..."
Abstract
 Add to MetaCart
Abstract We consider RealTime CORBA 2.0 (Dynamic Scheduling) distributable threads, whose time constraints are specified using time/utility functions (TUFs), operating in legacy environments. In legacy environments, system node resourcesboth physical (processor, disk, I/O, etc.) and logical
Actions as spacetime shapes
 IN ICCV
, 2005
"... Human action in video sequences can be seen as silhouettes of a moving torso and protruding limbs undergoing articulated motion. We regard human actions as threedimensional shapes induced by the silhouettes in the spacetime volume. We adopt a recent approach [14] for analyzing 2D shapes and genera ..."
Abstract

Cited by 651 (4 self)
 Add to MetaCart
and generalize it to deal with volumetric spacetime action shapes. Our method utilizes properties of the solution to the Poisson equation to extract spacetime features such as local spacetime saliency, action dynamics, shape structure and orientation. We show that these features are useful for action
Matching pursuits with timefrequency dictionaries
 IEEE Transactions on Signal Processing
, 1993
"... AbstractWe introduce an algorithm, called matching pursuit, that decomposes any signal into a linear expansion of waveforms that are selected from a redundant dictionary of functions. These waveforms are chosen in order to best match the signal structures. Matching pursuits are general procedures t ..."
Abstract

Cited by 1671 (13 self)
 Add to MetaCart
to compute adaptive signal representations. With a dictionary of Gabor functions a matching pursuit defines an adaptive timefrequency transform. We derive a signal energy distribution in the timefrequency plane, which does not include interference terms, unlike Wigner and Cohen class distributions. A
Pointsto Analysis in Almost Linear Time
, 1996
"... We present an interprocedural flowinsensitive pointsto analysis based on type inference methods with an almost linear time cost complexity. To our knowledge, this is the asymptotically fastest nontrivial interprocedural pointsto analysis algorithm yet described. The algorithm is based on a nons ..."
Abstract

Cited by 595 (3 self)
 Add to MetaCart
We present an interprocedural flowinsensitive pointsto analysis based on type inference methods with an almost linear time cost complexity. To our knowledge, this is the asymptotically fastest nontrivial interprocedural pointsto analysis algorithm yet described. The algorithm is based on a non
Symbolic Model Checking for Realtime Systems
 INFORMATION AND COMPUTATION
, 1992
"... We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given in an ..."
Abstract

Cited by 578 (50 self)
 Add to MetaCart
in an extension of CTL with clock variables). We develop an algorithm that computes this set of states symbolically as a fixpoint of a functional on state predicates, without constructing the state space. For this purpose, we introduce a calculus on computation trees over realnumbered time. Unfortunately
Graphbased algorithms for Boolean function manipulation
 IEEE TRANSACTIONS ON COMPUTERS
, 1986
"... In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner similar to the representations introduced by Lee [1] and Akers [2], but with further restrictions on th ..."
Abstract

Cited by 3526 (46 self)
 Add to MetaCart
on the ordering of decision variables in the graph. Although a function requires, in the worst case, a graph of size exponential in the number of arguments, many of the functions encountered in typical applications have a more reasonable representation. Our algorithms have time complexity proportional
Distributed spacetimecoded protocols for exploiting cooperative diversity in wireless networks
 IEEE TRANS. INF. THEORY
, 2003
"... We develop and analyze space–time coded cooperative diversity protocols for combating multipath fading across multiple protocol layers in a wireless network. The protocols exploit spatial diversity available among a collection of distributed terminals that relay messages for one another in such a m ..."
Abstract

Cited by 622 (5 self)
 Add to MetaCart
utilize a spacetime code to cooperatively relay to the destination. We demonstrate that these protocols achieve full spatial diversity in the number of cooperating terminals, not just the number of decoding relays, and can be used effectively for higher spectral efficiencies than repetitionbased schemes
Consensus Problems in Networks of Agents with Switching Topology and TimeDelays
, 2003
"... In this paper, we discuss consensus problems for a network of dynamic agents with fixed and switching topologies. We analyze three cases: i) networks with switching topology and no timedelays, ii) networks with fixed topology and communication timedelays, and iii) maxconsensus problems (or leader ..."
Abstract

Cited by 1112 (21 self)
 Add to MetaCart
In this paper, we discuss consensus problems for a network of dynamic agents with fixed and switching topologies. We analyze three cases: i) networks with switching topology and no timedelays, ii) networks with fixed topology and communication timedelays, and iii) maxconsensus problems (or
Results 1  10
of
3,550,816