Sciweavers

600 search results - page 104 / 120
» Validated cost models for sensor network queries
Sort
View
COR
2008
80views more  COR 2008»
14 years 11 months ago
Multi-period capacitated location with modular equipments
This work deals with a multi-period capacitated location problem inspired by telecommunication access network planning problems, where demands and costs vary from one period to an...
Éric Gourdin, Olivier Klopfenstein
PRL
2011
14 years 6 months ago
Efficient approximate Regularized Least Squares by Toeplitz matrix
Machine Learning based on the Regularized Least Square (RLS) model requires one to solve a system of linear equations. Direct-solution methods exhibit predictable complexity and s...
Sergio Decherchi, Paolo Gastaldo, Rodolfo Zunino
ALGORITHMICA
2002
94views more  ALGORITHMICA 2002»
14 years 11 months ago
The Quantum Black-Box Complexity of Majority
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...
Thomas P. Hayes, Samuel Kutin, Dieter van Melkebee...
ACSC
2006
IEEE
15 years 5 months ago
Modelling layer 2 and layer 3 device bandwidths using B-node theory
Modern computer networks contain an amalgamation of devices and technologies, with the performance exhibited by each central to digital communications. Varieties of methods exist ...
S. Cikara, Stanislaw P. Maj, David T. Shaw
CEC
2010
IEEE
14 years 9 months ago
The one-commodity traveling salesman problem with selective pickup and delivery: An ant colony approach
We introduce a novel combinatorial optimization problem: the one-commodity traveling salesman problem with selective pickup and delivery (1-TSP-SELPD), characterized by the fact th...
Rafael Falcón, Xu Li, Amiya Nayak, Ivan Sto...