1369 search results - page 74 / 274 » Lattice computations for random numbers |
JAL
2002
13 years 8 months ago
2002
We take a multivariate view of digital search trees by studying the number of nodes of different types that may coexist in a bucket digital search tree as it grows under an arbitr...
ICRA
2000
IEEE
2000
IEEE
Local Search Heuristics for the Assembly Line Balancing Problem with Incompatibilities Between Tasks
14 years 1 months ago
This paper deals with the Assembly Line Balancing Problem considering incompatibilities between the tasks with the aim of, first, minimizing the number of workstations and, then, ...
ISCA
2012
IEEE
11 years 11 months ago
2012
IEEE
—As the scales of parallel applications and platforms increase the negative impact of communication latencies on performance becomes large. Fortunately, modern High Performance C...
JCB
1998
13 years 8 months ago
1998
Abstract. The method of invariants is an approach to the problem of reconstructing the phylogenetic tree of a collection of m taxa using nucleotide sequence data. Models for the re...
MOBIHOC
2007
ACM
14 years 8 months ago
2007
ACM
The issue of transport capacity of a randomly deployed wireless network under random (c, f ) channel assignment was considered by us in [1]. We showed in [1] that when the number ...