4218 search results - page 236 / 844 » Complete sets of cooperations |
94
Voted
ICCD
2001
IEEE
15 years 9 months ago
2001
IEEE
We propose two new instructions, swperm and sieve, that can be used to efficiently complete an arbitrary bit-level permutation of an n-bit word with or without repetitions. Permut...
101
Voted
BIRTHDAY
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Van Glabbeek (1990) presented the linear time/branching time spectrum of behavioral equivalences for finitely branching, concrete, sequential processes. He studied these...
109
click to vote
KGC
1993
Springer
15 years 4 months ago
1993
Springer
We establish the complexity of decision problems associated with the nonmonotonic modal logic S4. We prove that the problem of existence of an S4-expansion for a given set A of pr...
91
Voted
NIPS
2007
15 years 2 months ago
2007
We consider apprenticeship learning—learning from expert demonstrations—in the setting of large, complex domains. Past work in apprenticeship learning requires that the expert...
92
Voted
SODA
2004
ACM
15 years 2 months ago
2004
ACM
In this paper we consider multiprocessor scheduling with hard deadlines and investigate the cost of eliminating migration in the online setting. Let I be any set of jobs that can ...