1480 search results - page 276 / 296 » Distributed algorithms for weighted problems in sparse graph... |
MOBICOM
2012
ACM
13 years 2 months ago
2012
ACM
Access to relative location of nearby vehicles on the local roads or on the freeways is useful for providing critical alerts to the drivers, thereby enhancing their driving experi...
106
click to vote
STOC
2007
ACM
16 years 3 days ago
2007
ACM
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
This paper presents a hybrid technique that combines List Scheduling (LS) with Genetic Algorithms (GA) for constructing non-preemptive schedules for soft real-time parallel applic...
110
click to vote
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
In some cases, evolutionary algorithms represent individuals as typical binary trees with n leaves and n-1 internal nodes. When designing a crossover operator for a particular rep...
ICSE
2008
IEEE-ACM
16 years 18 days ago
2008
IEEE-ACM
Several techniques have been developed for identifying similar code fragments in programs. These similar fragments, referred to as code clones, can be used to identify redundant c...