Sciweavers

3018 search results - page 403 / 604
» Replicating for Performance: Case Studies
Sort
View
ENTCS
2007
89views more  ENTCS 2007»
15 years 6 months ago
Weak Probabilistic Anonymity
Abstract. Anonymity means that the identity of the user performing a certain action is maintained secret. The protocols for ensuring anonymity often use random mechanisms which can...
Yuxin Deng, Catuscia Palamidessi, Jun Pang
MONET
2008
135views more  MONET 2008»
15 years 6 months ago
Understanding the Power of Distributed Coordination for Dynamic Spectrum Management
This paper investigates a distributed and adaptive approach to manage spectrum usage in dynamic spectrum access networks. While previous works focus on centralized provisioning, w...
Lili Cao, Haitao Zheng
SWARM
2008
SPRINGER
115views Optimization» more  SWARM 2008»
15 years 6 months ago
Path formation in a robot swarm
We present two swarm intelligence control mechanisms used for distributed robot path formation. In the first, the robots form linear chains. We study three variants of robot chains...
Shervin Nouyan, Alexandre Campo, Marco Dorigo
TCAD
2008
118views more  TCAD 2008»
15 years 6 months ago
CHIPS: Custom Hardware Instruction Processor Synthesis
This paper describes an integer-linear-programming (ILP)-based system called Custom Hardware Instruction Processor Synthesis (CHIPS) that identifies custom instructions for critica...
Kubilay Atasu, Can C. Özturan, Günhan D&...
TCS
2008
15 years 6 months ago
Main-memory triangle computations for very large (sparse (power-law)) graphs
Finding, counting and/or listing triangles (three vertices with three edges) in massive graphs are natural fundamental problems, which received recently much attention because of ...
Matthieu Latapy