893 search results - page 64 / 179 » Descent Theory for Schemes |
159
click to vote
SPAA
2005
ACM
15 years 11 months ago
2005
ACM
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
159
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
The authors employ multiple crossovers as a novel natural extension to crossovers as a mixing operator. They use this as a framework to explore the ideas of code growth. Empirical...
165
click to vote
ISLPED
2004
ACM
15 years 11 months ago
2004
ACM
The principle of adiabatic switching in conventional energyrecovery adiabatic circuit is generally explained in literature with the help of the rudimentary RC circuit driven by a ...
148
click to vote
HICSS
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper outlines the theoretical concept of a study currently under way in China. Its main idea is to explore the sustainability of centralized inter-organizational systems for...
162
click to vote
IWPC
2003
IEEE
15 years 11 months ago
2003
IEEE
A key desideratum for many software comprehension tools is to reduce the mental burdens of software engineers. That is, the tools should support cognition. This key benefit is di...