1382 search results - page 103 / 277 » Formal Analysis of Online Algorithms |
115
click to vote
WEBI
2007
Springer
16 years 6 days ago
2007
Springer
Identification of distinct clusters of documents in text collections has traditionally been addressed by making the assumption that the data instances can only be represented by ...
183
click to vote
EGPGV
2004
Springer
15 years 11 months ago
2004
Springer
This paper investigates assignment strategies (load balancing algorithms) for process farms which solve the problem of online placement of a constant number of independent tasks w...
186
click to vote
FTTCS
2006
15 years 6 months ago
2006
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...
155
click to vote
FM
2009
Springer
16 years 20 days ago
2009
Springer
Abstract. We present a new domain for analyzing must-equalities between address expressions. The domain is a smooth combination of Herbrand and affine equalities which enables us t...
133
click to vote
EXPERT
2008
15 years 6 months ago
2008
: In this article we analyze the current state of case-based plan adaptation research. We include the traditional distinction between transformational and derivational analogy but ...