Sciweavers

2107 search results - page 365 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
FOCS
2002
IEEE
15 years 7 months ago
Implicit B-Trees: New Results for the Dictionary Problem
We reopen the issue of finding an implicit data structure for the dictionary problem. In particular, we examine the problem of maintaining Ò data values in the first Ò locatio...
Gianni Franceschini, Roberto Grossi, J. Ian Munro,...
SAC
2009
ACM
15 years 7 months ago
Autonomous networked robots for the establishment of wireless communication in uncertain emergency response scenarios
During a disaster, emergency response operations can benefit from the establishment of a wireless ad hoc network. We propose the use of autonomous robots that move inside a disas...
Stelios Timotheou, Georgios Loukas
CHI
2000
ACM
15 years 7 months ago
Putting the feel in 'look and feel'
Haptic devices are now commercially available and thus touch has become a potentially realistic solution to a variety of interaction design challenges. We report on an investigati...
Ian Oakley, Marilyn Rose McGee, Stephen A. Brewste...
105
Voted
GECCO
2008
Springer
158views Optimization» more  GECCO 2008»
15 years 3 months ago
Objective reduction using a feature selection technique
This paper introduces two new algorithms to reduce the number of objectives in a multiobjective problem by identifying the most conflicting objectives. The proposed algorithms ar...
Antonio López Jaimes, Carlos A. Coello Coel...
CCE
2007
15 years 2 months ago
Adaptive optimisation of noisy black-box functions inherent in microscopic models
For systems where exact constitutive relations are unknown, a microscopic level description can be alternatively used. As microscopic simulations are computationally expensive, th...
Eddie Davis, Marianthi G. Ierapetritou