Sciweavers

70 search results - page 6 / 14
» Some properties of the regular asynchronous systems
Sort
View
CDC
2010
IEEE
117views Control Systems» more  CDC 2010»
13 years 2 months ago
Distributed iterative regularization algorithms for monotone Nash games
In this paper, we consider the development of single-timescale schemes for the distributed computation of Nash equilibria. In general, equilibria associated with convex Nash games ...
Aswin Kannan, Uday V. Shanbhag
MPC
1995
Springer
91views Mathematics» more  MPC 1995»
13 years 11 months ago
A Refinement Relation Supporting the Transition from Unbounded to Bounded Communication Buffers
This paper proposes a refinement relation supporting the transition from unbounded to bounded communication buffers. Employing this refinement relation, a system specification base...
Ketil Stølen
JCT
2010
113views more  JCT 2010»
13 years 5 months ago
Equations resolving a conjecture of Rado on partition regularity
A linear equation L is called k-regular if every k-coloring of the positive integers contains a monochromatic solution to L. Richard Rado conjectured that for every positive intege...
Boris Alexeev, Jacob Tsimerman
DATE
2007
IEEE
97views Hardware» more  DATE 2007»
14 years 1 months ago
Feasibility intervals for multiprocessor fixed-priority scheduling of arbitrary deadline periodic systems
In this paper we study the global scheduling of periodic task systems with arbitrary deadlines upon identical multiprocessor platforms. We first show two very general properties ...
Liliana Cucu, Joël Goossens
CORR
2004
Springer
177views Education» more  CORR 2004»
13 years 7 months ago
Typestate Checking and Regular Graph Constraints
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
Viktor Kuncak, Martin C. Rinard