372 search results - page 29 / 75 » time 1996 |
106
Voted
WSC
2008
15 years 2 months ago
2008
It is well known from queueing and simulation models that cycle times in capacitated production systems increase nonlinearly with resource utilization, which poses considerable di...
111
click to vote
AAAI
1996
15 years 1 months ago
1996
Anytime algorithms offer a tradeoff between solution quality and computation time that has proved useful in applying artificial intelligence techniques to time-critical problems. ...
104
Voted
AAAI
1996
15 years 1 months ago
1996
Overcoming the disadvantages of equidistant discretization of continuous actions, we introduce an approach that separates time into slices of varying length bordered by certain ev...
102
Voted
ATMN
1996
15 years 1 months ago
1996
In this work, the problem of scheduling packets with a group as opposed to an individual deadline is considered. Packets of the same group are supposed to belong in the same appli...
NIPS
1996
15 years 1 months ago
1996
It is shown that conventional computers can be exponentially faster than planar Hopfield networks: although there are planar Hopfield networks that take exponential time to conver...