Sciweavers

893 search results - page 64 / 179
» Descent Theory for Schemes
Sort
View
SPAA
2005
ACM
15 years 5 months ago
Name independent routing for growth bounded networks
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...
Ittai Abraham, Dahlia Malkhi
GECCO
2005
Springer
114views Optimization» more  GECCO 2005»
15 years 5 months ago
Exploiting disruption aversion to control code bloat
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...
Jason Stevens, Robert B. Heckendorn, Terence Soule
ISLPED
2004
ACM
118views Hardware» more  ISLPED 2004»
15 years 5 months ago
On optimality of adiabatic switching in MOS energy-recovery circuit
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 ...
Baohua Wang, Pinaki Mazumder
HICSS
2003
IEEE
117views Biometrics» more  HICSS 2003»
15 years 5 months ago
Developing Sustainable B2B E-Commerce Scenarios in the Chinese Context A Research Proposal
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...
Kai Reimers
IWPC
2003
IEEE
15 years 5 months ago
Observing and Measuring Cognitive Support: Steps Toward Systematic Tool Evaluation and Engineering
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...
Andrew Walenstein