Sciweavers

1191 search results - page 74 / 239
» Completeness and Performance Of The APO Algorithm
Sort
View
DSN
2002
IEEE
14 years 3 months ago
Optimizing Buffer Management for Reliable Multicast
Reliable multicast delivery requires that a multicast message be received by all members in a group. Hence certain or all members need to buffer messages for possible retransmissi...
Zhen Xiao, Kenneth P. Birman, Robbert van Renesse
CEC
2009
IEEE
14 years 2 months ago
Parallel BMDA with an aggregation of probability models
—The paper is focused on the problem of aggregation of probability distribution applicable for parallel Bivariate Marginal Distribution Algorithm (pBMDA). A new approach based on...
Jirí Jaros, Josef Schwarz
KR
1998
Springer
14 years 2 months ago
Using an Expressive Description Logic: FaCT or Fiction?
Description Logics form a family of formalisms closely related to semantic networks but with the distinguishing characteristic that the semantics of the concept description langua...
Ian Horrocks
IANDC
2006
86views more  IANDC 2006»
13 years 10 months ago
Table design in dynamic programming
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...
Peter Steffen, Robert Giegerich
TCS
2010
13 years 8 months ago
Tight results for Next Fit and Worst Fit with resource augmentation
It is well known that the two simple algorithms for the classic bin packing problem, NF and WF both have an approximation ratio of 2. However, WF seems to be a more reasonable alg...
Joan Boyar, Leah Epstein, Asaf Levin