951 search results - page 146 / 191 » On the Computation of Correctly-Rounded Sums |
177
click to vote
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
176
click to vote
AUSDM
2008
Springer
15 years 6 months ago
2008
Springer
Complex network analysis involves the study of the properties of various real world networks. In this broad field, research on community structures forms an important sub area. Th...
166
click to vote
CSL
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We present decision procedures for logical constraints involving collections such as sets, multisets, and fuzzy sets. Element membership in our collections is given by ch...
129
click to vote
EWRL
2008
15 years 5 months ago
2008
If one possesses a model of a controlled deterministic system, then from any state, one may consider the set of all possible reachable states starting from that state and using any...
136
click to vote
ATMOS
2007
15 years 5 months ago
2007
We face a real-world train unit assignment problem for an operator running trains in a regional area. Given a set of timetabled train trips, each with a required number of passenge...