4843 search results - page 764 / 969 » The Shortcut Problem - Complexity and Approximation |
169
Voted
COMSWARE
2008
IEEE
15 years 5 months ago
2008
IEEE
Social networks refer to structures made of nodes that represent people or other entities embedded in a social context, and whose edges represent interaction between entities. Typi...
148
click to vote
SODA
2008
ACM
15 years 5 months ago
2008
ACM
We study the problem of scheduling permanent jobs on unrelated machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing ...
142
Voted
IPCO
2004
15 years 5 months ago
2004
Managing an industrial production facility requires carefully allocating limited resources, and gives rise to large, potentially complicated scheduling problems. In this paper we c...
136
click to vote
COR
2007
15 years 3 months ago
2007
Scheduling under controllable machining conditions has been studied for some time. Scheduling with tool changes, particularly due to tool wear, has just begun to receive attention...
120
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
We consider qualitative and quantitative verification problems for infinite-state Markov chains. We call a Markov chain decisive w.r.t. a given set of target states F if it almos...