4377 search results - page 256 / 876 » Mass problems and randomness |
192
click to vote
EAAI
2007
15 years 6 months ago
2007
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is deļ¬...
193
Voted
TASE
2008
IEEE
15 years 6 months ago
2008
IEEE
This paper addresses the general single-machine earliness-tardiness problem with distinct release dates, due dates, and unit costs. The aim of this research is to obtain an exact n...
187
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...
140
click to vote
CPM
2004
Springer
16 years 2 days ago
2004
Springer
Given a set S = {s1, s2, . . . , sn} of strings each of length m, and an integer L, we study the following two problems. k-Closest Substring problem: ļ¬nd k center strings c1, c2,...
170
click to vote
EOR
2007
15 years 6 months ago
2007
In this paper, we study the procurement problem faced by a buyer who needs to purchase a variety of goods from suppliers applying a so-called total quantity discount policy. This ...