415 search results - page 14 / 83 » An efficient approximation for the Generalized Assignment Pr... |
SPAA
2003
ACM
15 years 4 months ago
2003
ACM
In the classical load balancing or multiprocessor scheduling problem, we are given a sequence of jobs of varying sizes and are asked to assign each job to one of the m empty proce...
203
click to vote
SIGMOD
2009
ACM
15 years 12 months ago
2009
ACM
Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respe...
89
Voted
ESA
2010
Springer
15 years 23 days ago
2010
Springer
In a Content Distribution Network application, we have a set of servers and a set of clients to be connected to the servers. Often there are a few server types and a hard budget co...
104
Voted
ATAL
2008
Springer
2008
Springer
Efficient approximate inference in distributed Bayesian networks for MAS-based sensor interpretation
15 years 1 months ago
The multiply sectioned Bayesian network (MSBN) framework is the most studied approach for distributed Bayesian Network inference in an MAS setting. This paper describes a new fram...
STOC
2006
ACM
15 years 12 months ago
2006
ACM
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...