Sciweavers

2370 search results - page 212 / 474
» The Characterization of Data-Accumulating Algorithms
Sort
View
GECCO
2005
Springer
155views Optimization» more  GECCO 2005»
15 years 9 months ago
An artificial immune network for multimodal function optimization on dynamic environments
Multimodal optimization algorithms inspired by the immune system are generally characterized by a dynamic control of the population size and by diversity maintenance along the sea...
Fabrício Olivetti de França, Fernand...
IWMM
2004
Springer
90views Hardware» more  IWMM 2004»
15 years 9 months ago
Automatic heap sizing: taking real memory into account
Heap size has a huge impact on the performance of garbage collected applications. A heap that barely meets the application’s needs causes excessive GC overhead, while a heap tha...
Ting Yang, Matthew Hertz, Emery D. Berger, Scott F...
ATAL
2003
Springer
15 years 9 months ago
Robust software via agent-based redundancy
This paper describes how multiagent systems can be used to achieve robust software, one of the major goals of software engineering. The paper first positions itself within the sof...
Michael N. Huhns, Vance T. Holderfield, Rosa Laura...
124
Voted
FGR
2002
IEEE
161views Biometrics» more  FGR 2002»
15 years 9 months ago
Baseline Results for the Challenge Problem of Human ID Using Gait Analysis
Identification of people from gait captured on video has become a challenge problem in computer vision. However, there is not a baseline algorithm or standard dataset for measuri...
P. Jonathon Phillips, Patrick Grother, Sudeep Sark...
LICS
1997
IEEE
15 years 8 months ago
The Complexity of Subtype Entailment for Simple Types
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...
Fritz Henglein, Jakob Rehof