8825 search results - page 305 / 1765 » All for one or one for all |
107
click to vote
IOR
2002
15 years 1 months ago
2002
We describe a simple on-line heuristic for scheduling job-shops. We assume there is a fixed set of routes for the jobs, and many jobs, say N, on each route. The heuristic uses saf...
135
click to vote
SAGT
2010
Springer
15 years 7 days ago
2010
Springer
Abstract. One reason for wanting to compute an (approximate) Nash equilibrium of a game is to predict how players will play. However, if the game has multiple equilibria that are f...
152
click to vote
CCGRID
2010
IEEE
14 years 11 months ago
2010
IEEE
Data-intensive parallel applications on clouds need to deploy large data sets from the cloud's storage facility to all compute nodes as fast as possible. Many multicast algori...
146
click to vote
IWMM
2011
Springer
14 years 4 months ago
2011
Springer
We propose a new memory model called short-term memory for managing objects on the heap. In contrast to the traditional persistent memory model for heap management, objects in sho...
190
Voted
CVPR
2009
IEEE
16 years 9 months ago
2009
IEEE
Given an image, we propose a hierarchical generative
model that classifies the overall scene, recognizes and segments
each object component, as well as annotates the image
with ...