Sciweavers

3223 search results - page 37 / 645
» The Scaling of Search Cost
Sort
View
EOR
2008
91views more  EOR 2008»
13 years 8 months ago
A branch-and-bound algorithm for the linear ordering problem with cumulative costs
The Linear Ordering Problem with Cumulative Costs is an NP-hard combinatorial optimization problem arising from an application in UMTS mobile-phone communication systems. This pap...
Giovanni Righini
ICVS
2009
Springer
14 years 2 months ago
Visual Registration Method for a Low Cost Robot
Abstract— An autonomous mobile robot must face the correspondence or data association problem in order to carry out tasks like place recognition or unknown environment mapping. I...
David Aldavert, Arnau Ramisa, Ricardo Toledo, Ramo...
ICC
2007
IEEE
14 years 2 months ago
A Cost-Effective Approach to Optical Packet/burst Scheduling
Abstract— Optical Burst and Packet Switching are being considered as the most promising paradigms to increase bandwidth efficiency in IP over DWDM networks. In both cases, due t...
Franco Callegati, Aldo Campi, Walter Cerroni
SIGMOD
2000
ACM
141views Database» more  SIGMOD 2000»
14 years 12 days ago
Counting, Enumerating, and Sampling of Execution Plans in a Cost-Based Query Optimizer
Testing an SQL database system by running large sets of deterministic or stochastic SQL statements is common practice in commercial database development. However, code defects oft...
Florian Waas, César A. Galindo-Legaria
ECML
2006
Springer
13 years 11 months ago
Cost-Sensitive Learning of SVM for Ranking
Abstract. In this paper, we propose a new method for learning to rank. `Ranking SVM' is a method for performing the task. It formulizes the problem as that of binary classific...
Jun Xu, Yunbo Cao, Hang Li, Yalou Huang