Sciweavers

8647 search results - page 497 / 1730
» The Container Selection Problem
Sort
View
PLANX
2008
15 years 7 months ago
Complexity of Earliest Query Answering with Streaming Tree Automata
We investigate the complexity of earliest query answering for n-ary node selection queries defined by streaming tree automata (STAs). We elaborate an algorithm that selects query ...
Olivier Gauwin, Anne-Cécile Caron, Joachim ...
SCAI
2008
15 years 7 months ago
Defect Prediction in Hot Strip Rolling Using ANN and SVM
One of the largest factors affecting the loss for steel manufacturing are defects in the steel strips produced. Therefore the prediction of these defects forehand would be very im...
Manu Hietaniemi, Ulla Elsilä, Perttu Laurinen...
DICTA
2003
15 years 7 months ago
Embedded Voxel Colouring
Abstract. The reconstruction of a complex scene from multiple images is a fundamental problem in the field of computer vision. Volumetric methods have proven to be a strong altern...
Carlos Leung, Ben Appleton, Changming Sun
WSC
1998
15 years 7 months ago
Criteria for Simulation Software Evaluation
In simulation software selection problems, packages are evaluated either on their own merits or in comparison with other packages. In either method, a list of criteria for evaluat...
Jalal Nikoukaran, Vlatka Hlupic, Ray J. Paul
163
Voted
CORR
2010
Springer
143views Education» more  CORR 2010»
15 years 6 months ago
Opportunistic Routing in Ad Hoc Networks: How many relays should there be? What rate should nodes use?
Opportunistic routing is a multi-hop routing scheme which allows for selection of the best immediately available relay. In blind opportunistic routing protocols, where transmitters...
Joseph Blomer, Nihar Jindal