Sciweavers

4403 search results - page 172 / 881
» Galois Theory of Algorithms
Sort
View
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
16 years 1 months ago
Increasing the Gap between Descriptional Complexity and Algorithmic Probability
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
Adam R. Day
CISS
2008
IEEE
16 years 27 days ago
Distributed algorithm and reversible network
Motivated to design a feasible optical network architecture for the future Internet, we address the question of scheduling (wavelength assignment) in an optical network. The key ch...
Shreevatsa Rajagopalan, Devavrat Shah
ICPP
2006
IEEE
16 years 13 days ago
Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
David A. Bader, Kamesh Madduri
INFOCOM
2006
IEEE
16 years 13 days ago
Impact of Human Mobility on the Design of Opportunistic Forwarding Algorithms
— Studying transfer opportunities between wireless devices carried by humans, we observe that the distribution of the inter-contact time, that is the time gap separating two cont...
Augustin Chaintreau, Pan Hui, Jon Crowcroft, Chris...
GECCO
2005
Springer
130views Optimization» more  GECCO 2005»
15 years 12 months ago
Quality-time analysis of multi-objective evolutionary algorithms
A quality-time analysis of multi-objective evolutionary algorithms (MOEAs) based on schema theorem and building blocks hypothesis is developed. A bicriteria OneMax problem, a hypo...
Jian-Hung Chen, Shinn-Ying Ho, David E. Goldberg