Sciweavers

7065 search results - page 1156 / 1413
» Iterative Scheduling Algorithms
Sort
View
FMSB
2008
199views Formal Methods» more  FMSB 2008»
15 years 8 months ago
Bounded Asynchrony: Concurrency for Modeling Cell-Cell Interactions
We introduce bounded asynchrony, a notion of concurrency tailored to the modeling of biological cell-cell interactions. Bounded asynchrony is the result of a scheduler that bounds ...
Jasmin Fisher, Thomas A. Henzinger, Maria Mateescu...
ICAI
2003
15 years 7 months ago
A Quantitative Model of Capabilities in Multi-Agent Systems
Reasoning about capabilities in multi-agent systems is crucial for many applications. There are two aspects of reasoning about the capabilities of an agent to achieve its goals. O...
Linli He, Thomas R. Ioerger
CCGRID
2010
IEEE
15 years 7 months ago
The Effects of Untruthful Bids on User Utilities and Stability in Computing Markets
Markets of computing resources typically consist of a cluster (or a multi-cluster) and jobs that arrive over time and request computing resources in exchange for payment. In this p...
Sergei Shudler, Lior Amar, Amnon Barak, Ahuva Mu'a...
207
Voted
ECCV
2006
Springer
16 years 8 months ago
A Comparative Study of Energy Minimization Methods for Markov Random Fields
One of the most exciting advances in early vision has been the development of efficient energy minimization algorithms. Many early vision tasks require labeling each pixel with som...
Richard Szeliski, Ramin Zabih, Daniel Scharstein, ...
STOC
2007
ACM
239views Algorithms» more  STOC 2007»
16 years 6 months ago
Approximating minimum bounded degree spanning trees to within one of optimal
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
Mohit Singh, Lap Chi Lau
« Prev « First page 1156 / 1413 Last » Next »