3319 search results - page 479 / 664 » Type Theoretical Databases |
124
click to vote
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
136
click to vote
ICTCS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We consider the problem of maintaining polynomial and exponential decay aggregates of a data stream, where the weight of values seen from the stream diminishes as time el...
131
click to vote
IPTPS
2005
Springer
15 years 10 months ago
2005
Springer
Most earlier studies of DHTs under churn have either depended on simulations as the primary investigation tool, or on establishing bounds for DHTs to function. In this paper, we pr...
119
click to vote
WEA
2005
Springer
15 years 10 months ago
2005
Springer
Vectors [Extended Abstract] Pekka Orponen and Satu Elisa Schaeffer Laboratory for Theoretical Computer Science, P.O. Box 5400 FI-02015 TKK Helsinki University of Technology, Finlan...
187
click to vote
ANTSW
2004
Springer
15 years 10 months ago
2004
Springer
A general-purpose, simulation-based algorithm S-ACO for solving stochastic combinatorial optimization problems by means of the ant colony optimization (ACO) paradigm is investigate...