Sciweavers

3433 search results - page 315 / 687
» Heuristics for a bidding problem
Sort
View
SODA
1998
ACM
106views Algorithms» more  SODA 1998»
15 years 8 months ago
Greedy Strikes Back: Improved Facility Location Algorithms
A fundamental facility location problem is to choose the location of facilities, such as industrial plants and warehouses, to minimize the cost of satisfying the demand for some c...
Sudipto Guha, Samir Khuller
AI
1998
Springer
15 years 6 months ago
A Complete Anytime Algorithm for Number Partitioning
Given a set of numbers, the two-way partitioning problem is to divide them into two subsets, so that the sum of the numbers in each subset are as nearly equal as possible. The pro...
Richard E. Korf
COMSWARE
2007
IEEE
16 years 1 months ago
On Optimal Performance in Mobile Ad hoc Networks
In this paper we are concerned with finding the maximum throughput that a mobile ad hoc network can support. Even when nodes are stationary, the problem of determining the capaci...
Tapas K. Patra, Joy Kuri, Pavan Nuggehalli
EMNLP
2008
15 years 8 months ago
Phrase Translation Probabilities with ITG Priors and Smoothing as Learning Objective
The conditional phrase translation probabilities constitute the principal components of phrase-based machine translation systems. These probabilities are estimated using a heurist...
Markos Mylonakis, Khalil Sima'an
IADIS
2004
15 years 8 months ago
Mastering the mystery through 'SAIQ' metrics of user experience in telecollaboration business systems
In the preparation of technology transition, the contextual and alternative definitions of the usability heuristics of multifaceted role of the best practice methodology of Teleco...
Venkatesh Mahadevan, Zenon Chaczko, Robin Braun