Results 261 to 270 of about 786,683 (318)
JMIR Med InformSome of the next articles are maybe not open access.
Related searches:
Related searches:
Current Opinion in Psychology, 2019
To schedule activities and transition from one activity to the next, humans can rely on the external clock (clock-time style) or on their internal sense (event-time style). This article discusses how relying on an external time cue versus an internal time cue can markedly shape the way people perceive the social world, beyond its mere purpose of ...
Anne-Laure, Sellier, Tamar, Avnet
openaire +2 more sources
To schedule activities and transition from one activity to the next, humans can rely on the external clock (clock-time style) or on their internal sense (event-time style). This article discusses how relying on an external time cue versus an internal time cue can markedly shape the way people perceive the social world, beyond its mere purpose of ...
Anne-Laure, Sellier, Tamar, Avnet
openaire +2 more sources
2012 19th International Conference on High Performance Computing, 2012
We study the problem of scheduling in parallel systems with many users. We analyze scenarios with many submissions issued over time by several users. These submissions contain one or more jobs; the set of submissions are organized in successive campaigns.
Pinheiro, Vinicius +2 more
openaire +1 more source
We study the problem of scheduling in parallel systems with many users. We analyze scenarios with many submissions issued over time by several users. These submissions contain one or more jobs; the set of submissions are organized in successive campaigns.
Pinheiro, Vinicius +2 more
openaire +1 more source
Real-Time Systems, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wang, Weirong +2 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wang, Weirong +2 more
openaire +1 more source
Operations Research, 1997
We consider the open shop, job shop, and flow shop scheduling problems with integral processing times. We give polynomial-time algorithms to determine if an instance has a schedule of length at most 3, and show that deciding if there is a schedule of length at most 4 is 𝒩𝒫-complete. The latter result implies that, unless 𝒫 = 𝒩𝒫, there does not exist a
Williamson, David P. +6 more
openaire +3 more sources
We consider the open shop, job shop, and flow shop scheduling problems with integral processing times. We give polynomial-time algorithms to determine if an instance has a schedule of length at most 3, and show that deciding if there is a schedule of length at most 4 is 𝒩𝒫-complete. The latter result implies that, unless 𝒫 = 𝒩𝒫, there does not exist a
Williamson, David P. +6 more
openaire +3 more sources