4377 search results - page 598 / 876 » Mass problems and randomness |
228
click to vote
INFOCOM
1991
IEEE
15 years 10 months ago
1991
IEEE
customer which exceeds its deadline will either leave the queue without service or stay in the queue to get unsucWe consider the problem of scheduling impatient CUS- cessful servic...
169
click to vote
NIPS
2007
15 years 8 months ago
2007
The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known ...
194
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
159
click to vote
ATAL
2009
Springer
15 years 7 months ago
2009
Springer
Motion planning for mobile agents, such as robots, acting in the physical world is a challenging task, which traditionally concerns safe obstacle avoidance. We are interested in p...
187
click to vote
CSDA
2008
15 years 6 months ago
2008
Tree models are valuable tools for predictive modeling and data mining. Traditional tree-growing methodologies such as CART are known to suffer from problems including greediness,...