848 search results - page 88 / 170 » Randomness and the linear degrees of computability |
107
click to vote
SECON
2008
IEEE
15 years 6 months ago
2008
IEEE
—We describe and evaluate a suite of distributed and computationally efficient algorithms for solving a class of convex optimization problems in wireless sensor networks. The pr...
WSC
1998
15 years 1 months ago
1998
Bootstrapping is a resampling technique that requires less computer time than simulation does. Bootstrapping -like simulation-must be defined for each type of application. This pa...
110
click to vote
IJHIS
2007
14 years 11 months ago
2007
This paper describes a new hybrid method based on the application of the Population Training Algorithm (PTA) and linear programming (LP) for generation of schedules for drivers in...
POLICY
2007
Springer
15 years 6 months ago
2007
Springer
The implementation of network security devices such as firewalls and IDSs are constantly being improved to accommodate higher security and performance standards. Using reliable a...
103
click to vote
OL
2010
14 years 10 months ago
2010
In this note we consider the properties of the Hamming distance in combinatorial optimization problems on hypergraph matchings, also known as multidimensional assignment problems....