Sciweavers

16430 search results - page 919 / 3286
» On Computable Tree Functions
Sort
View
209
Voted
STOC
1994
ACM
134views Algorithms» more  STOC 1994»
15 years 11 months ago
A coding theorem for distributed computation
Shannon's Coding Theorem shows that in order to reliably transmit a message of T bits over a noisy communication channel, only a constant slowdown factor is necessary in the ...
Sridhar Rajagopalan, Leonard J. Schulman
DEXAW
2004
IEEE
170views Database» more  DEXAW 2004»
15 years 11 months ago
On-Line Analytical Processing on Large Databases Managed by Computational Grids
Management of large data repositories integrated into the Grid poses new challenges for Grid research. There already exist several successful Data Grid projects addressing process...
Bernhard Fiser, Umut Onan, Ibrahim Elsayed, Peter ...
GECCO
2006
Springer
168views Optimization» more  GECCO 2006»
15 years 11 months ago
3D airspace sectoring by evolutionary computation: real-world applications
This paper presents a new method for 3D cutting of geometrical space with application to airspace sectoring. This problem comes from the air traffic management but the proposed me...
Daniel Delahaye, Stephane Puechmorel
GECCO
2006
Springer
207views Optimization» more  GECCO 2006»
15 years 11 months ago
Both robust computation and mutation operation in dynamic evolutionary algorithm are based on orthogonal design
A robust dynamic evolutionary algorithm (labeled RODEA), where both the robust calculation and mutation operator are based on an orthogonal design, is proposed in this paper. Prev...
Sanyou Y. Zeng, Rui Wang, Hui Shi, Guang Chen, Hug...
CDES
2006
99views Hardware» more  CDES 2006»
15 years 9 months ago
Teraflop Computing for Nanoscience
: Over the last three decades there has been significant progress in the first principles methods for calculating the properties of materials at the quantum level. They have largel...
Yang Wang 0008, G. M. Stocks, Aurelian Rusanu, D. ...