Sciweavers

8413 search results - page 152 / 1683
» Ordering Problem Subgoals
Sort
View
ESA
2005
Springer
146views Algorithms» more  ESA 2005»
14 years 3 months ago
An Approximation Algorithm for the Minimum Latency Set Cover Problem
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...
Refael Hassin, Asaf Levin
CATS
2008
13 years 11 months ago
An ILP for the metro-line crossing problem
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...
Matthew Asquith, Joachim Gudmundsson, Damian Merri...
ICMLA
2009
13 years 8 months ago
Learning Deep Neural Networks for High Dimensional Output Problems
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...
Benjamin Labbé, Romain Hérault, Cl&e...
SIGECOM
2009
ACM
92views ECommerce» more  SIGECOM 2009»
14 years 4 months ago
The adwords problem: online keyword matching with budgeted bidders under random permutations
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 ...
Nikhil R. Devenur, Thomas P. Hayes
ECP
1997
Springer
88views Robotics» more  ECP 1997»
14 years 2 months ago
A Time and Resource Problem for Planning Architectures
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...
Amedeo Cesta, Cristiano Stella