8413 search results - page 152 / 1683 » Ordering Problem Subgoals |
155
click to vote
ESA
2005
Springer
15 years 11 months ago
2005
Springer
The input to the minimum latency set cover problem (MLSC) consists of a set of jobs and a set of tools. Each job j needs a specific subset Sj of the tools in order to be processed...
176
click to vote
CATS
2008
15 years 7 months ago
2008
In this paper we consider a problem that occurs when drawing public transportation networks. Given an embedded graph G = (V, E) (e.g. the railroad network) and a set H of paths in...
187
click to vote
ICMLA
2009
15 years 4 months ago
2009
State-of-the-art pattern recognition methods have difficulty dealing with problems where the dimension of the output space is large. In this article, we propose a new framework ba...
131
click to vote
SIGECOM
2009
ACM
16 years 24 days ago
2009
ACM
We consider the problem of a search engine trying to assign a sequence of search keywords to a set of competing bidders, each with a daily spending limit. The goal is to maximize ...
154
click to vote
ECP
1997
Springer
15 years 10 months ago
1997
Springer
This paper concerns the problem of resource reasoning in planning. It defines formally a constraint satisfaction problem, the Time and Resource Problem (T RP), in which resource r...