13306 search results - page 2492 / 2662 » Theoretical Computer Science |
171
click to vote
SDM
2009
SIAM
16 years 4 months ago
2009
SIAM
Metaheuristics represent an important class of techniques to solve, approximately, hard combinatorial optimization problems for which the use of exact methods is impractical. In t...
168
click to vote
ECIR
2009
Springer
16 years 4 months ago
2009
Springer
For bounded datasets such as the TREC Web Track (WT10g) the computation of term frequency (TF) and inverse document frequency (IDF) is not difficult. However, when the corpus is th...
173
click to vote
ICWS
2009
IEEE
16 years 4 months ago
2009
IEEE
Advances in the areas of embedded systems, computing, and networking are leading to an infrastructure composed of millions of heterogeneous devices. These devices will not simply ...
205
click to vote
SPAA
2009
ACM
16 years 4 months ago
2009
ACM
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
183
click to vote
SPAA
2009
ACM
16 years 4 months ago
2009
ACM
Abstract. At-most-once semantics is one of the standard models for object access in decentralized systems. Accessing an object, such as altering the state of the object by means of...