2702 search results - page 538 / 541 » constraints 2008 |
SIGIR
2008
ACM
14 years 9 months ago
2008
ACM
It is difficult to apply machine learning to new domains because often we lack labeled problem instances. In this paper, we provide a solution to this problem that leverages domai...
111
click to vote
SIGMETRICS
2008
ACM
14 years 9 months ago
2008
ACM
Advances in networking technology have enabled network engineers to use sampled data from routers to estimate network flow volumes and track them over time. However, low sampling ...
SMA
2008
ACM
14 years 9 months ago
2008
ACM
Surface matching is fundamental to shape computing and various downstream applications. This paper develops a powerful pants decomposition framework for computing maps between sur...
TASE
2008
IEEE
14 years 9 months ago
2008
IEEE
This paper considers a matrix-based discrete event control approach for a warehouse. The control system is organized in two modules: a dynamic model and a controller. The model pro...
TASE
2008
IEEE
14 years 9 months ago
2008
IEEE
Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...