128 search results - page 7 / 26 » Working Smarter, Not Harder |
POPL
1993
ACM
13 years 11 months ago
1993
ACM
A polymorphic function is parametric if its behavior does not depend on the type at which it is instantiated. Starting with Reynolds's work, the study of parametricity is typ...
HCI
2007
13 years 9 months ago
2007
The driving force of our current research is the development of medical training systems using augmented reality techniques. To provide multimodal feedback for the simulation, hapt...
HEURISTICS
2010
13 years 2 months ago
2010
The challenge in shift scheduling lies in the construction of a set of work shifts, which are subject to specific regulations, in order to cover fluctuating staff demands. This pro...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
AIPS
2010
13 years 10 months ago
2010
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...