Sciweavers

1855 search results - page 173 / 371
» A coding theorem for distributed computation
Sort
View
110
Voted
CORR
2002
Springer
111views Education» more  CORR 2002»
15 years 3 months ago
The Fastest and Shortest Algorithm for All Well-Defined Problems
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
Marcus Hutter
184
Voted
SIGMETRICS
2004
ACM
206views Hardware» more  SIGMETRICS 2004»
15 years 9 months ago
Performance aware tasking for environmentally powered sensor networks
The use of environmental energy is now emerging as a feasible energy source for embedded and wireless computing systems such as sensor networks where manual recharging or replacem...
Aman Kansal, Dunny Potter, Mani B. Srivastava
137
Voted
ISPA
2005
Springer
15 years 9 months ago
Redundancy Schemes for High Availability in DHTs
High availability in peer-to-peer DHTs requires data redundancy. This paper takes user download behavior into account to evaluate redundancy schemes in data storage and share syste...
Fan Wu, Tongqing Qiu, YueQuan Chen, Guihai Chen
129
Voted
IEEEPACT
2003
IEEE
15 years 9 months ago
Y-Branches: When You Come to a Fork in the Road, Take It
In this paper, we study the effects of manipulating the architected direction of conditional branches. Through the use of statistical sampling, we find that about 40% of all dyna...
Nicholas J. Wang, Michael Fertig, Sanjay J. Patel
124
Voted
FIDJI
2003
Springer
15 years 8 months ago
Seamless UML Support for Service-Based Software Architectures
The UML has become the de facto standard for the analysis and design of complex software. Tool support today includes the generation of code realizing the structural model describe...
Matthias Tichy, Holger Giese