3946 search results - page 280 / 790 » The computational complexity of choice sets |
222
click to vote
FC
2007
Springer
16 years 28 days ago
2007
Springer
Task-specific groups are often formed in an ad-hoc manner within big structures, like companies. Take the following typical scenario: A high rank manager decides that a task force...
179
Voted
JAPLL
2008
15 years 6 months ago
2008
In this paper, we study the following basic problem: After having executed a sequence of actions, find a sequence of actions that brings the agent back to the state just before th...
232
click to vote
ISPASS
2009
IEEE
16 years 1 months ago
2009
IEEE
Modern Graphic Processing Units (GPUs) provide sufficiently flexible programming models that understanding their performance can provide insight in designing tomorrow’s manyco...
150
click to vote
OR
2005
Springer
16 years 7 days ago
2005
Springer
The fare planning problem for public transport is to design a system of fares that maximize the revenue. We introduce a nonlinear optimization model to approach this problem. It i...
173
click to vote
AAAI
1998
15 years 8 months ago
1998
We have built a set of integrated AI systems (called conversation machines) to enable transaction processing over the telephone for limited domains like stock trading and banking....