Sciweavers

364 search results - page 22 / 73
» Generalized normal forms and polynomial system solving
Sort
View
74
Voted
PPOPP
2010
ACM
15 years 7 months ago
Featherweight X10: a core calculus for async-finish parallelism
We present a core calculus with two of X10's key constructs for parallelism, namely async and finish. Our calculus forms a convenient basis for type systems and static analys...
Jonathan K. Lee, Jens Palsberg
94
Voted
CDC
2009
IEEE
189views Control Systems» more  CDC 2009»
15 years 2 months ago
Maximizing aggregated revenue in sensor networks under deadline constraints
Abstract— We study the problem of maximizing the aggregated revenue in sensor networks with deadline constraints. Our model is that of a sensor network that is arranged in the fo...
Srikanth Hariharan, Ness B. Shroff
75
Voted
CDC
2008
IEEE
15 years 4 months ago
Noise suppression in auto-regulatory gene networks
— Living cells are characterized by small populations of key molecular components that have large stochastic noise associated with them. Various gene network motifs exists within...
Abhyudai Singh, João Pedro Hespanha
67
Voted
ENTCS
2008
115views more  ENTCS 2008»
14 years 9 months ago
Time Separation of Events: An Inverse Method
The problem of "time separation" can be stated as follows: Given a system made of several connected components, each one entailing a local delay known with uncertainty, ...
Emmanuelle Encrenaz, Laurent Fribourg
SIGECOM
2005
ACM
97views ECommerce» more  SIGECOM 2005»
15 years 3 months ago
Complexity of (iterated) dominance
We study various computational aspects of solving games using dominance and iterated dominance. We first study both strict and weak dominance (not iterated), and show that checki...
Vincent Conitzer, Tuomas Sandholm