Sciweavers

1702 search results - page 18 / 341
» Using Nondeterminism to Design Efficient Deterministic Algor...
Sort
View
SODA
2004
ACM
102views Algorithms» more  SODA 2004»
13 years 9 months ago
The hyperring: a low-congestion deterministic data structure for distributed environments
In this paper we study the problem of designing concurrent searchable data structures with performance guarantees that can be used in a distributed environment where data elements...
Baruch Awerbuch, Christian Scheideler
GECCO
2005
Springer
190views Optimization» more  GECCO 2005»
14 years 1 months ago
An efficient evolutionary algorithm applied to the design of two-dimensional IIR filters
This paper presents an efficient technique of designing twodimensional IIR digital filters using a new algorithm involving the tightly coupled synergism of particle swarm optimiza...
Swagatam Das, Amit Konar, Uday Kumar Chakraborty
NJC
2006
125views more  NJC 2006»
13 years 7 months ago
PRO: A Model for the Design and Analysis of Efficient and Scalable Parallel Algorithms
Abstract. We present a new parallel computation model called the Parallel ResourceOptimal computation model. PRO is a framework being proposed to enable the design of efficient and...
Assefaw Hadish Gebremedhin, Mohamed Essaïdi, ...
NPL
2000
95views more  NPL 2000»
13 years 7 months ago
Bayesian Sampling and Ensemble Learning in Generative Topographic Mapping
Generative topographic mapping (GTM) is a statistical model to extract a hidden smooth manifold from data, like the self-organizing map (SOM). Although a deterministic search algo...
Akio Utsugi
CORR
2010
Springer
102views Education» more  CORR 2010»
13 years 7 months ago
On the Design of Efficient CSMA Algorithms for Wireless Networks
Recently, it has been shown that CSMA algorithms which use queue length-based link weights can achieve throughput optimality in wireless networks. In particular, a key result by Ra...
Javad Ghaderi, R. Srikant