5580 search results - page 673 / 1116 » Randomized priority algorithms |
136
click to vote
LCN
2005
IEEE
15 years 10 months ago
2005
IEEE
— The sensing capabilities of networked sensors are affected by environmental factors in real deployment and it is imperative to have practical considerations at the design stage...
125
click to vote
APPROX
2005
Springer
15 years 10 months ago
2005
Springer
There has been significant interest lately in the task of constructing codes that are testable with a small number of random probes. Ben-Sasson and Sudan show that the repeated te...
126
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
This research presents an analysis of the reported successes of the Cartesian Genetic Programming method on a simplified form of the Boolean parity problem. We show the method of...
127
click to vote
ICN
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Recent developments in computer and communication networks require scheduling decisions to be made under increasingly complex system dynamics. We model and analyze the pr...
125
click to vote
ASPDAC
2004
ACM
15 years 10 months ago
2004
ACM
--Octilinear interconnect is a promising technique to shorten wire lengths. We present two practical heuristic octilinear Steiner tree (OSMT) algorithms in the paper. They are both...