5448 search results - page 280 / 1090 » Breakpoints and Time in Distributed Computations |
158
click to vote
ALMOB
2006
15 years 6 months ago
2006
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
172
click to vote
WSC
1997
15 years 8 months ago
1997
Creating comprehensive simulation models can be expensive and time consuming. This paper discusses our efforts to develop a general methodology that will allow users to quickly an...
193
click to vote
AIPS
2009
15 years 7 months ago
2009
We define the robustness of a sequential plan as the probability that it will execute successfully despite uncertainty in the execution environment. We consider a rich notion of u...
147
click to vote
ICCAD
2005
IEEE
16 years 3 months ago
2005
IEEE
Placement migration is a critical step to address a variety of postplacement design closure issues, such as timing, routing congestion, signal integrity, and heat distribution. To...
147
click to vote
ICPADS
2005
IEEE
16 years 6 days ago
2005
IEEE
: We discuss a group protocol which supports applications with group communication service when QoS supported by networks or required by applications is changed. An autonomic group...