740 search results - page 113 / 148 » An approximation ratio for biclustering |
100
click to vote
SIGECOM
2009
ACM
15 years 6 months ago
2009
ACM
Voting trees describe an iterative procedure for selecting a single vertex from a tournament. vide a very general abstract model of decision-making among a group of individuals, a...
114
click to vote
EUROPAR
2005
Springer
15 years 5 months ago
2005
Springer
The model of moldable task (MT) was introduced some years ago and has been proved to be an efficient way for implementing parallel applications. It considers a target application ...
FCT
2005
Springer
15 years 5 months ago
2005
Springer
Usually, for bin packing problems, we try to minimize the number of bins used or in the case of the dual bin packing problem, maximize the number or total size of accepted items. ...
AOR
2007
14 years 12 months ago
2007
We consider the job shop scheduling problem unit−Jm, where each job is processed once on each of m given machines. Every job consists of a permutation of tasks for all machines....
AI
2011
Springer
14 years 6 months ago
2011
Springer
When donating money to a (say, charitable) cause, it is possible to use the contemplated donation as a bargaining chip to induce other parties interested in the charity to donate ...