1191 search results - page 114 / 239 » Completeness and Performance Of The APO Algorithm |
137
Voted
INFOCOM
2007
IEEE
15 years 9 months ago
2007
IEEE
Abstract—In this paper we address the problem of energyefficient event detection in wireless sensor networks (WSNs). Duty cycling is a fundamental approach to conserving energy i...
137
Voted
GECCO
2010
Springer
15 years 6 months ago
2010
Springer
We use affine arithmetic to improve both the performance and the robustness of genetic programming for symbolic regression. During evolution, we use affine arithmetic to analyze e...
96
Voted
ATAL
2008
Springer
15 years 5 months ago
2008
Springer
We study the problem of agents locating other agents that are both capable and willing to help complete assigned tasks. An agent incurs a fixed cost for each help request it sends...
98
Voted
DAC
2009
ACM
16 years 4 months ago
2009
ACM
In this paper, we present a novel flip-chip routing algorithm for package-board co-design. Unlike the previous works that can consider only either free- or pre-assignment routing,...
103
Voted
EDBT
2008
ACM
16 years 3 months ago
2008
ACM
Users often do not require a complete answer to their query but rather only a sample. They expect the sample to be either the largest possible or the most representative (or both)...