8647 search results - page 604 / 1730 » The Container Selection Problem |
214
click to vote
AE
2003
Springer
16 years 10 days ago
2003
Springer
Abstract. The graph partitioning problem consists of dividing the vertices of a graph into a set of balanced parts, such that the number of edges connecting vertices in different ...
168
click to vote
ATAL
2003
Springer
16 years 10 days ago
2003
Springer
In complex distributed applications, a problem is often decomposed into a set of subproblems that are distributed to multiple agents. We formulate this class of problems with a tw...
177
click to vote
ICANN
2001
Springer
15 years 11 months ago
2001
Springer
In manipulating data such as in supervised learning, we often extract new features from original features for the purpose of reducing the dimensions of feature space and achieving ...
235
click to vote
INFOCOM
2000
IEEE
15 years 11 months ago
2000
IEEE
Abstract—The future Internet is expected to support applications with quality of service (QoS) requirements. For this end several mechanisms are suggested in the IETF to support ...
180
click to vote
KR
1989
Springer
15 years 11 months ago
1989
Springer
In this work we extend the work of Dean, Kaelbling, Kirman and Nicholson on planning under time constraints in stochastic domains to handle more complicated scheduling problems. I...