Sciweavers

2310 search results - page 65 / 462
» The selection efficiency of tournaments
Sort
View
AAAI
1998
13 years 9 months ago
Branch and Bound Algorithm Selection by Performance Prediction
Wepropose a method called Selection by Performance Prediction (SPP) which allows one, when faced with a particular problem instance, to select a Branch and Boundalgorithm from amo...
Lionel Lobjois, Michel Lemaître
CACM
2008
53views more  CACM 2008»
13 years 7 months ago
Distributed selection: a missing piece of data aggregation
In this article, we study the problem of distributed selection from a theoretical point of view. Given a general connected graph of diameter D consisting of n nodes in which each ...
Fabian Kuhn, Thomas Locher, Roger Wattenhofer
AROBOTS
2002
126views more  AROBOTS 2002»
13 years 7 months ago
Selecting Landmarks for Localization in Natural Terrain
We describe techniques to optimally select landmarks for performing mobile robot localization by matching terrain maps. The method is based upon a maximum-likelihood robot localiza...
Clark F. Olson
REFSQ
2007
Springer
14 years 1 months ago
Integrated Requirement Selection and Scheduling for the Release Planning of a Software Product
This paper investigates two integer linear programming models that integrate requirement scheduling into software release planning. The first model can schedule the development of ...
C. Li, J. M. van den Akker, Sjaak Brinkkemper, Gui...
IFIP
1989
Springer
13 years 11 months ago
Broadcasting with Selective Reduction
ÐBSR (Broadcasting with Selective Reduction) is a PRAM more powerful than any CRCW PRAM. In order to extend the Broadcast Instruction of BSR and make it more useful for a large cl...
Selim G. Akl, G. R. Guenther