4066 search results - page 207 / 814 » Almost Complete Sets |
176
click to vote
BIRTHDAY
2005
Springer
16 years 2 days 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...
180
click to vote
KGC
1993
Springer
15 years 10 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...
151
click to vote
NIPS
2007
15 years 8 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...
151
click to vote
SODA
2004
ACM
15 years 8 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 ...
188
click to vote
ATS
2010
IEEE
15 years 3 months ago
2010
IEEE
Systems with many integrated circuits (ICs), often of the same type, are increasingly common to meet the constant performance demand. However, systems in recent semiconductor techn...